A unified solution framework for multi-attribute vehicle routing problems
From MaRDI portal
Publication:2514767
DOI10.1016/j.ejor.2013.09.045zbMath1304.90004OpenAlexW2028630422WikidataQ56619953 ScholiaQ56619953MaRDI QIDQ2514767
Teodor Gabriel Crainic, Christian Prins, Thibaut Vidal, Michel Gendreau
Publication date: 3 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.09.045
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Simple heuristics for the multi-period fleet size and mix vehicle routing problem, Fleet design optimisation from historical data using constraint programming and large neighbourhood search, Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction, A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering, A survey of recent research on location-routing problems, Rich vehicle routing problems: from a taxonomy to a definition, A deterministic iterated local search algorithm for the vehicle routing problem with backhauls, Min-Max vs. Min-Sum vehicle routing: a worst-case analysis, Integrated production and multiple trips vehicle routing with time windows and uncertain travel times, Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer, Comparison of anticipatory algorithms for a dial-a-ride problem, Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints, An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP, A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows, The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm, Thirty years of heterogeneous vehicle routing, A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem, Solving the multi-vehicle multi-covering tour problem, Hybrid metaheuristics for the clustered vehicle routing problem, An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem, An open source spreadsheet solver for vehicle routing problems, Vehicle routing with backhauls: review and research perspectives, A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows, Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem, A review of vehicle routing with simultaneous pickup and delivery, MineReduce: an approach based on data mining for problem size reduction, A hybrid adaptive large neighborhood search heuristic for the team orienteering problem, A metaheuristic based on tabu search for solving a technician routing and scheduling problem, A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem, Combined maintenance and routing optimization for large-scale sewage cleaning, Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics, Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood, Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities, The vehicle routing problem with service level constraints, A concise guide to existing and emerging vehicle routing problem variants, The vehicle routing problem with arrival time diversification on a multigraph, Step cost functions in a fleet size and mix vehicle routing problem with time windows, A matheuristic for the asymmetric capacitated vehicle routing problem, An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem, Adjusting the order crossover operator for capacitated vehicle routing problems, The multi-vehicle cumulative covering tour problem, Neural networks for local search and crossover in vehicle routing: a possible overkill?, Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location, Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND, On the exact solution of vehicle routing problems with backhauls, Solving the multi‐objective bike routing problem by meta‐heuristic algorithms, Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit, Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs, On the general problem statement of cargo carriages scheduling and ways to solve it, Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem, An improved memetic algorithm for integrated production scheduling and vehicle routing decisions, Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows, Hybrid genetic algorithm for undirected traveling salesman problems with profits, Resource constrained routing and scheduling: review and research prospects, Multi-trip pickup and delivery problem with time windows and synchronization, Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems, Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem, An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup, Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows, Memetic search for the minmax multiple traveling salesman problem with single and multiple depots, The board packing problem, Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics, Decision support for the technician routing and scheduling problem, A hybrid genetic algorithm for the Hamiltonian p‐median problem, A unified matheuristic for solving multi-constrained traveling salesman problems with profits, Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem, Adaptive large neighborhood search on the graphics processing unit, The Vehicle Routing Problem with Release and Due Dates, Heuristics for vehicle routing problems: sequence or set optimization?, The sales force sizing problem with multi-period workload assignments, and service time windows, Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, Solution strategies for the vehicle routing problem with backhauls, A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem, New benchmark instances for the capacitated vehicle routing problem, Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints, A comment on: ``What makes a VRP solution good? The generation of problem-specific knowledge for heuristics, Bi-objective offshore supply vessel planning with costs and persistence objectives, A simple and effective hybrid genetic search for the job sequencing and tool switching problem, Metaheuristic for the Vehicle Routing Problem with Backhauls and Time Windows, Multi-trip time-dependent vehicle routing problem with time windows, A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem, Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks, The split delivery vehicle routing problem with three-dimensional loading constraints, Bidirectional labeling for solving vehicle routing and truck driver scheduling problems, Implicit depot assignments and rotations in vehicle routing heuristics, A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm, Industrial and tramp ship routing problems: closing the gap for real-scale instances, Development and implementation of algorithms for vehicle routing during a no-notice evacuation, On the one-to-one pickup-and-delivery problem with time windows and trailers, Integrated timetabling and vehicle scheduling with balanced departure times, On solving the time window assignment vehicle routing problem via iterated local search, Robust Data-Driven Vehicle Routing with Time Windows, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, Spatial coverage in routing and path planning problems, Neural large neighborhood search for routing problems, A unified exact approach for clustered and generalized vehicle routing problems, A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
Uses Software
Cites Work
- A hybrid algorithm for a class of vehicle routing problems
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- Local search for the undirected capacitated arc routing problem with profits
- The case for strategic oscillation
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- A library of local search heuristics for the vehicle routing problem
- A unified heuristic for a large class of vehicle routing problems with backhauls
- The vehicle routing problem with flexible time windows and traveling times
- A general heuristic for vehicle routing problems
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- The vehicle routing problem. Latest advances and new challenges.
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- A hybrid evolution strategy for the open vehicle routing problem
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- The fleet size and mix vehicle routing problem
- The vehicle routing problem with backhauls
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A new branching strategy for time constrained routing problems with application to backhauling
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- A simple and effective metaheuristic for the minimum latency problem
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem
- Industrial aspects and literature survey: Combined inventory management and routing
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A variable neighborhood search heuristic for periodic routing problems
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- A unified exact method for solving different classes of vehicle routing problems
- Resource extension functions: properties, inversion, and generalization to segments
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
- Implicit depot assignments and rotations in vehicle routing heuristics
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- The Vehicle Routing Problem
- An Exact Method for the Capacitated Location-Routing Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A Parallel Algorithm for the Vehicle Routing Problem
- A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics
- An Exact Algorithm for the Period Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- The fleet size and mix vehicle routing problem with time windows
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics
- Some applications of the generalized vehicle routing problem
- A memetic algorithm for the vehicle routing problem with time windows
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
- Column Generation
- A unified tabu search algorithm for vehicle routing problems with soft time windows
- Artificial Evolution
- A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item