Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
From MaRDI portal
Publication:4286472
DOI10.1287/opre.41.5.935zbMath0797.90021OpenAlexW2165387188MaRDI 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
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
A multi-start local search algorithm for the vehicle routing problem with time windows, Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, Robust vehicle routing problem with hard time windows under demand and travel time uncertainty, The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement, Dynamic vehicle routing: Status and prospects, Routing problems: A bibliography, Expected part delays as a secondary layout criterion in automated manufacturing systems, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Algorithms for the Vehicle Routing Problems with Time Deadlines, DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic, Probabilistic diversification and intensification in local search for vehicle routing, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, Matheuristics: survey and synthesis, A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem, An exponential (matching based) neighborhood for the vehicle routing problem, Cyclic transfers in school timetabling, Constraint-based very large-scale neighborhood search, Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand, Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach, Employee workload balancing by graph partitioning, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling, Heuristics for the lexicographic Max-ordering vehicle routing problem, 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 facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand, Recent progress of local search in handling the time window constraints of the vehicle routing problem, A survey of very large-scale neighborhood search techniques, Active guided evolution strategies for large-scale vehicle routing problems with time windows, Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem, Creating very large scale neighborhoods out of smaller ones by compounding moves, Convexity and global optimization: A theoretical link, Algorithms for the design of network topologies with balanced disjoint rings, AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS, 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 genetic algorithm for service level based vehicle scheduling, A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning, Heuristic approaches to vehicle routing with backhauls and time windows, An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity, On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties, Fast local search algorithms for the handicapped persons transportation problem, Current modeling practices in bank courier scheduling, Savings based ant colony optimization for the capacitated minimum spanning tree problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
