Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
From MaRDI portal
Publication:4286472
DOI10.1287/opre.41.5.935zbMath0797.90021MaRDI QIDQ4286472
Harilaos N. Psaraftis, Paul M. Thompson
Publication date: 6 April 1994
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.41.5.935
scheduling; worst-case performance; neighborhood search algorithms; cyclic transfers; multivehicle routing
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
Related Items
Algorithms for the Vehicle Routing Problems with Time Deadlines, AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS, Convexity and global optimization: A theoretical link, A survey of very large-scale neighborhood search techniques, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem, A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem, A genetic algorithm for service level based vehicle scheduling, Expected part delays as a secondary layout criterion in automated manufacturing systems, On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties, Current modeling practices in bank courier scheduling, Active guided evolution strategies for large-scale vehicle routing problems with time windows, A route-neighborhood-based metaheuristic for vehicle routing problem with time windows, A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem., A multi-start local search algorithm for the vehicle routing problem with time windows, Dynamic vehicle routing: Status and prospects, Routing problems: A bibliography, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Probabilistic diversification and intensification in local search for vehicle routing, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, An exponential (matching based) neighborhood for the vehicle routing problem, Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling, Heuristics for the lexicographic Max-ordering vehicle routing problem, Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem, Creating very large scale neighborhoods out of smaller ones by compounding moves, Heuristic approaches to vehicle routing with backhauls and time windows, An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity, Fast local search algorithms for the handicapped persons transportation problem, Savings based ant colony optimization for the capacitated minimum spanning tree problem, Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach
