An efficient transformation of the generalized vehicle routing problem

DOI10.1016/S0377-2217(99)00073-9zbMath0968.90010OpenAlexW2168381469MaRDI QIDQ1971986

Publication date: 23 March 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00073-9

zbMATH Keywords

location-routing capacitated arc routing problem generalized vehicle routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items

Approximation algorithms for solving the constrained arc routing problem in mixed graphs, Efficient elementary and restricted non-elementary route pricing, Picker routing in the mixed-shelves warehouses of e-commerce retailers, A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem, Dealing with time in the multiple traveling salespersons problem with moving targets, An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size, Hybrid metaheuristics for the clustered vehicle routing problem, Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm, A fast two-level variable neighborhood search for the clustered vehicle routing problem, An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties, Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity, Large multiple neighborhood search for the soft-clustered vehicle-routing problem, The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem, The vehicle routing problem with service level constraints, A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution, A branch-and-cut algorithm for the generalized traveling salesman problem with time windows, Location‐routing problem: a classification of recent research, Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm, The vehicle routing problem with time windows and flexible delivery locations, Real-time passenger bus routing problems with preferences and tradeoffs, Improved lower bounds and exact algorithm for the capacitated arc routing problem, New mathematical models of the generalized vehicle routing problem and extensions, The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm, The capacitated general windy routing problem with turn penalties, Resource planning and a depot location model for electric power restoration., Solving an urban waste collection problem using ants heuristics, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, Shortest path tour problem with time windows, The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances, A way to optimally solve a time-dependent vehicle routing problem with time windows, Approximation algorithms for group prize-collecting and location-routing problems, An improved hybrid ant-local search algorithm for the partition graph coloring problem, Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size, A generalized shortest path tour problem with time windows, A taxonomical analysis, current methods and objectives on location-routing problems, A unified exact approach for clustered and generalized vehicle routing problems, A Time-Indexed Generalized Vehicle Routing Model and Stabilized Column Generation for Military Aircraft Mission Planning

Cites Work