Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading-Reference-Cited by-同舟云学术

Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

Published:2007-11 Issue:4 Volume:19 Page:618-632
ISSN:1091-9856
Container-title:INFORMS Journal on Computing
language:en
Short-container-title:INFORMS Journal on Computing

Author:

Carrabs Francesco,Cordeau Jean-François,Laporte Gilbert

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

General Engineering

Link

https://pubsonline.informs.org/doi/pdf/10.1287/ijoc.1060.0202

Reference23 articles.

1. Carrabs F. Heuristics and exact approaches for transportation problems with pickup and delivery. (2005) . Ph.D. thesis, Dipartimento di Matematica ed Informatica, Universitá di Salerno, Fisciano, Italy

2. An Additive Bounding Procedure for Combinatorial Optimization Problems

3. Variable Neighborhood Search

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

1. Review on impact of carbon pricing on sustainable practices in food processing and distribution;Trends in Food Science & Technology;2024-08

2. The last-mile delivery vehicle routing problem with handling cost in the front warehouse mode;Computers & Industrial Engineering;2024-04

3. Decomposition-Based Multiobjective Evolutionary Optimization With Tabu Search for Dynamic Pickup and Delivery Problems;IEEE Transactions on Intelligent Transportation Systems;2024

4. A Contextual Framework for Learning Routing Experiences in Last-Mile Delivery;2024

5. A multicommodity pickup and delivery problem with time windows and handling time in the omni‐channel last‐mile delivery;International Transactions in Operational Research;2023-08-02