New mathematical models of the generalized vehicle routing problem and extensions
From MaRDI portal
Publication:2428862
DOI10.1016/J.APM.2011.05.037zbMATH Open1236.90019OpenAlexW1973551898MaRDI QIDQ2428862FDOQ2428862
Authors: Petrica 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
Recommendations
- Some applications of the generalized vehicle routing problem
- A unified exact approach for clustered and generalized vehicle routing problems
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
- An efficient transformation of the generalized vehicle routing problem
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
integer programmingnetwork designvehicle routing problemgeneralized traveling salesman problemgeneralized vehicle routing problem
Cites Work
- The symmetric generalized traveling salesman polytope
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Routing problems: A bibliography
- An efficient transformation of the generalized vehicle routing problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- What you should know about the vehicle routing problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Title not available (Why is that?)
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
- Some applications of the clustered travelling salesman problem
- Some applications of the generalized vehicle routing problem
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- A branch-and-cut algorithm for vehicle routing problems
Cited In (24)
- The joint order batching and picker routing problem: modelled and solved as a clustered 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
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
- The cumulative school bus routing problem: Polynomial‐size formulations
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
- 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
- A general vehicle routing problem
- Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm
- Large multiple neighborhood search for the clustered vehicle-routing problem
- Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time
- Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
- Hybrid metaheuristics for the clustered vehicle routing problem
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- Title not available (Why is that?)
- Clustered vehicle routing problem for waste collection with smart operational management approaches
- Enhanced savings calculation and its applications for solving capacitated vehicle routing problem
- Selective generalized travelling salesman problem
- Real-time passenger bus routing problems with preferences and tradeoffs
- A distance function for computing on finite subsets of Euclidean spaces
- Some applications of the generalized vehicle routing problem
This page was built for publication: New mathematical models of the generalized vehicle routing problem and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2428862)
