Designing vehicle routes for a mix of different request types, under time windows and loading constraints
Authors:
- Emmanouil E. ZachariadisEZEmmanouil E. Zachariadis
- Christos D. TarantilisCTChristos D. Tarantilis
- Chris T. KiranoudisCKChris T. Kiranoudis
- 1 September 2013
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 229 (2) , 303-317
Abstract
No abstract availableThis publication has 32 references indexed in Scilit:
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraintsComputers & Operations Research, 2012
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacksNetworks, 2012
- New Route Relaxation and Pricing Strategies for the Vehicle Routing ProblemOperations Research, 2011
- An Exact Algorithm for the Pickup and Delivery Problem with Time WindowsOperations Research, 2011
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problemComputers & Operations Research, 2011
- Extreme Point-Based Heuristics for Three-Dimensional Bin PackingINFORMS Journal on Computing, 2008
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems2008
- Metaheuristics for the vehicle routing problem with loading constraintsNetworks, 2007
- TTT plots: a perl program to create time-to-target plotsOptimization Letters, 2006
- Probability Distribution of Solution Time in GRASP: An Experimental InvestigationJournal of Heuristics, 2002