Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
Author
Abstract
Suggested Citation
DOI: 10.1287/opre.41.5.935
Download full text from publisher
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- S Abdullah & S Ahmadi & E K Burke & M Dror & B McCollum, 2007. "A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(11), pages 1494-1502, November.
- Andreas Stenger & Daniele Vigo & Steffen Enz & Michael Schwind, 2013. "An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping," Transportation Science, INFORMS, vol. 47(1), pages 64-80, February.
- T. Ibaraki & S. Imahori & M. Kubo & T. Masuda & T. Uno & M. Yagiura, 2005. "Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints," Transportation Science, INFORMS, vol. 39(2), pages 206-232, May.
- Sébastien Mouthuy & Florence Massen & Yves Deville & Pascal Van Hentenryck, 2015. "A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows," Transportation Science, INFORMS, vol. 49(2), pages 223-238, May.
- Olli Bräysy, 2003. "A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 15(4), pages 347-368, November.
- Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
- Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
- Liu, Fuh-Hwa Franklin & Shen, Sheng-Yuan, 1999. "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 118(3), pages 485-504, November.
- Eric Angel & Evripidis Bampis & Fanny Pascual, 2008. "An exponential (matching based) neighborhood for the vehicle routing problem," Journal of Combinatorial Optimization, Springer, vol. 15(2), pages 179-190, February.
- Christian Billing & Florian Jaehn & Thomas Wensing, 2018. "A multiperiod auto-carrier transportation problem with probabilistic future demands," Journal of Business Economics, Springer, vol. 88(7), pages 1009-1028, September.
- Braysy, Olli & Hasle, Geir & Dullaert, Wout, 2004. "A multi-start local search algorithm for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 159(3), pages 586-605, December.
- Crainic, Teodor Gabriel & Perboli, Guido & Tadei, Roberto, 2009. "TS2PACK: A two-level tabu search for the three-dimensional bin packing problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 744-760, June.
- Gerald Senarclens de Grancy & Marc Reimann, 2016. "Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 24(1), pages 29-48, March.
- Ravindra K. Ahuja & Wei Huang & H. Edwin Romeijn & Dolores Romero Morales, 2007. "A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 14-26, February.
- T Öncan & S N Kabadi & K P K Nair & A P Punnen, 2008. "VLSN search algorithms for partitioning problems using matching neighbourhoods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 388-398, March.
- Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
- J-Y Potvin & M-A Naud, 2011. "Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 326-336, February.
- Ravindra K. Ahuja & Jon Goodstein & Amit Mukherjee & James B. Orlin & Dushyant Sharma, 2007. "A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 416-428, August.
- Xue Bai & Ning Ma & Kwai-Sang Chin, 2022. "Hybrid Heuristic for the Multi-Depot Static Bike Rebalancing and Collection Problem," Mathematics, MDPI, vol. 10(23), pages 1-28, December.
- Sungwon Lee & Taesung Hwang, 2018. "Estimating Emissions from Regional Freight Delivery under Different Urban Development Scenarios," Sustainability, MDPI, vol. 10(4), pages 1-14, April.
- Antonio Frangioni & Emiliano Necciari & Maria Grazia Scutellà, 2004. "A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 195-220, June.
- Hideki Hashimoto & Mutsunori Yagiura & Shinji Imahori & Toshihide Ibaraki, 2013. "Recent progress of local search in handling the time window constraints of the vehicle routing problem," Annals of Operations Research, Springer, vol. 204(1), pages 171-187, April.
More about this item
Keywords
programming; integer; heuristic: cyclic transfer algorithms for fleet planning problems; transportation; vehicle routing: cyclic transfer algorithms for multivehicle problems;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:41:y:1993:i:5:p:935-946. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.