The vehicle routing problem with service level constraints
From MaRDI portal
Publication:1681277
DOI10.1016/j.ejor.2017.08.027zbMath1374.90043arXiv1706.03097OpenAlexW2626159659MaRDI QIDQ1681277
Thibaut Vidal, Rafael Martinelli, Minh Hoàng Hà, Teobaldo Bulhões
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.03097
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
An exact solution approach for the inventory routing problem with time windows ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule ⋮ The two‐echelon routing problem with truck and drones ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ A generic exact solver for vehicle routing and related problems ⋮ Bi-objective blood product scheduling under blood shortage and limited supply ⋮ Heuristics for vehicle routing problems: sequence or set optimization? ⋮ Industrial and tramp ship routing problems: closing the gap for real-scale instances ⋮ Optimal charging and repositioning of electric vehicles in a free-floating carsharing system
Uses Software
Cites Work
- Unnamed Item
- Efficient elementary and restricted non-elementary route pricing
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem
- Solving the team orienteering problem with cutting planes
- The orienteering problem: a survey
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A path relinking approach for the team orienteering problem
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- The hot strip mill production scheduling problem: A tabu search approach
- A tabu search heuristic for the undirected selective travelling salesman problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Optimal solutions for routing problems with profits
- An efficient transformation of the generalized vehicle routing problem
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- A branch-and-cut algorithm for the capacitated profitable tour problem
- An effective PSO-inspired algorithm for the team orienteering problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A guided local search metaheuristic for the team orienteering problem
- The hot-rolling batch scheduling method based on the prize collecting vehicle routing problem
- An exact algorithm for team orienteering problems
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A unified solution framework for multi-attribute vehicle routing problems
- Projection results for vehicle routing
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- The capacitated team orienteering and profitable tour problems
- Some applications of the generalized vehicle routing problem
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Solving the Orienteering Problem through Branch-and-Cut
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
This page was built for publication: The vehicle routing problem with service level constraints
