Vehicle routing problem with vector profits with max-min criterion

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 63
  • Download : 0
This article introduces a new routing problem referred to as the vehicle routing problem with vector profits. Given a network composed of nodes (depot/sites) and arcs connecting the nodes, the problem determines routes that depart from the depot, visit sites to collect profits, and return to the depot. There are multiple stakeholders interested in the mission and each site is associated with a vector whose kth element represents the profit value for the kth stakeholder. The objective of the problem is to maximize the profit sum for the least satisfied stakeholder, i.e. the stakeholder with the smallest total profit value. An approach based on linear programming relaxation and column-generation to solve this max-min type routing problem was developed. Two case studies-the planetary surface exploration and the Rome tour cases-were presented to demonstrate the effectiveness of the proposed problem formulation and solution methodology.
Publisher
TAYLOR & FRANCIS LTD
Issue Date
2019-02
Language
English
Article Type
Article
Citation

ENGINEERING OPTIMIZATION, v.51, no.2, pp.352 - 367

ISSN
0305-215X
DOI
10.1080/0305215X.2018.1458845
URI
http://hdl.handle.net/10203/249788
Appears in Collection
AE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0