Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems

DOI10.1287/OPRE.41.5.935zbMATH Open0797.90021OpenAlexW2165387188MaRDI QIDQ4286472FDOQ4286472

Authors: 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

Recommendations

• Approximation algorithms for the multi-vehicle scheduling problem
• A multi-shift vehicle routing problem with windows and cycle times
• Improved algorithms for single vehicle scheduling on tree/cycle networks
• The dynamic multi-period vehicle routing problem
• Exact algorithms for routing problems under vehicle capacity constraints
• The vehicle routing problem with load-dependent travel times for cargo bicycles
• The synchronized multi-commodity multi-service transshipment-hub location problem with cyclic schedules
• Multi-objective vehicle routing problems
• On a periodic vehicle routing problem

zbMATH Keywords

schedulingworst-case performanceneighborhood search algorithmscyclic transfersmultivehicle routing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

Cited In (49)

• Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
• An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• Savings based ant colony optimization for the capacitated minimum spanning tree problem
• Fast local search algorithms for the handicapped persons transportation problem
• An exponential (matching based) neighborhood for the vehicle routing problem
• Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Cyclic transfers in school timetabling
• A genetic algorithm for service level based vehicle scheduling
• Constraint-based very large-scale neighborhood search
• A survey of very large-scale neighborhood search techniques
• Matheuristics: survey and synthesis
• A multi-start local search algorithm for the vehicle routing problem with time windows
• Dynamic vehicle routing: Status and prospects
• AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS
• A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
• A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning
• Employee workload balancing by graph partitioning
• Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
• Creating very large scale neighborhoods out of smaller ones by compounding moves
• The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
• Routing problems: A bibliography
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
• Probabilistic diversification and intensification in local search for vehicle routing
• Algorithms for the Vehicle Routing Problems with Time Deadlines
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
• Convexity and global optimization: A theoretical link
• Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
• Heuristics for the lexicographic Max-ordering vehicle routing problem
• 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.
• Heuristic approaches to vehicle routing with backhauls and time windows
• Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
• A Solution Procedure for the Vehicle-Scheduling Problem Based on Iterative Route Improvement
• A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
• Expected part delays as a secondary layout criterion in automated manufacturing systems
• Algorithms for the design of network topologies with balanced disjoint rings
• 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

This page was built for publication: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286472)