New mathematical models of the generalized vehicle routing problem and extensions
From MaRDI portal
Publication:2428862
DOI10.1016/j.apm.2011.05.037zbMath1236.90019OpenAlexW1973551898MaRDI QIDQ2428862
Petrică C. Pop, Andrei Horvat-Marc, Imdat Kara
Publication date: 21 April 2012
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.05.037
integer programmingvehicle routing problemnetwork designgeneralized traveling salesman problemgeneralized vehicle routing problem
Related Items (19)
An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size ⋮ Hybrid metaheuristics for the clustered vehicle routing problem ⋮ Selective generalized travelling salesman problem ⋮ A fast two-level variable neighborhood search for the clustered vehicle routing problem ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ 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 ⋮ A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution ⋮ Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm ⋮ Real-time passenger bus routing problems with preferences and tradeoffs ⋮ The cumulative school bus routing problem: Polynomial‐size formulations ⋮ A distance function for computing on finite subsets of Euclidean spaces ⋮ Large multiple neighborhood search for the clustered vehicle-routing problem ⋮ Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming ⋮ Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning ⋮ Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time ⋮ Enhanced savings calculation and its applications for solving capacitated vehicle routing problem ⋮ New mathematical model for the bi-objective inventory routing problem with a step cost function: a multi-objective particle swarm optimization solution approach ⋮ The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions
Cites Work
- Unnamed Item
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- A branch-and-cut algorithm for vehicle routing problems
- Routing problems: A bibliography
- An efficient transformation of the generalized vehicle routing problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- What you should know about the vehicle routing problem
- Some applications of the generalized vehicle routing problem
- Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Some applications of the clustered travelling salesman problem
- The symmetric generalized traveling salesman polytope
This page was built for publication: New mathematical models of the generalized vehicle routing problem and extensions
