Optimal vehicle routing with lower and upper bounds on route durations-Reference-Cited by-同舟云学术

Optimal vehicle routing with lower and upper bounds on route durations

Published:2015-02-02 Issue:2 Volume:65 Page:166-179
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Bektaş Tolga¹,Lysgaard Jens²

Affiliation:

1. Southampton Business School and Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton; SO17 1BJ Southampton United Kingdom

2. CORAL, Department of Economics and Business; Aarhus University; Fuglesangs Allé 4 DK-8210 Aarhus Denmark

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/net.21592/fullpdf

Reference25 articles.

1. Formulations and benders decomposition algorithms for multidepot salesmen problems with load balancing;Bektaş;Eur J Oper Res,2012

2. New techniques for cost sharing in combinatorial optimization games;Caprara;Math Program,2010

3. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints;Desrochers;Oper Res Lett,1991

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A variable neighborhood search for Open Vehicle Routing Problem;Concurrency and Computation: Practice and Experience;2022-12-29

2. Advertising through UAVs: Optimized path system for delivering smart real‐estate advertisement materials;International Journal of Intelligent Systems;2021-03-28

3. A personalized walking bus service requiring optimized route decisions: A real case;European Journal of Operational Research;2021-03

4. Using ℓ -norms for fairness in combinatorial optimisation;Computers & Operations Research;2020-08

5. An Exact Algorithm for the Green Vehicle Routing Problem;Transportation Science;2017-11