The traveling purchaser problem and its variants
From MaRDI portal
Publication:1751767
DOI10.1016/j.ejor.2016.12.017zbMath1394.90487OpenAlexW2564703335MaRDI QIDQ1751767
Renata Mansini, Jorge Riera-Ledesma, Daniele Manerba
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.12.017
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
The bi-objective traveling purchaser problem with deliveries, A stochastic programming model for a tactical solid waste management problem, New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty, The bi-objective insular traveling salesman problem with maritime and ground transportation costs, The traveling purchaser problem with fast service option, Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand, A GRASP/Path‐Relinking algorithm for the traveling purchaser problem, A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand, A generalized bin packing problem for parcel delivery in last-mile logistics, Prioritized single nurse routing and scheduling for home healthcare services, A tailored Benders decomposition approach for last-mile delivery with autonomous robots, Parameterized algorithms and complexity for the traveling purchaser problem and its variants, A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
- An effective matheuristic for the capacitated total quantity discount problem
- A column generation approach for a school bus routing problem with resource constraints
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms
- Exploring greedy criteria for the dynamic traveling purchaser problem
- A heuristic approach for the travelling purchaser problem
- Models for a traveling purchaser problem with additional side-constraints
- Solving the asymmetric traveling purchaser problem
- Supplier selection and order lot sizing modeling: a review
- The traveling purchaser problem with budget constraint
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Transgenetic algorithm for the traveling purchaser problem
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Travelling purchaser problem
- A branch and bound algorithm for the traveling purchaser problem
- Improved solutions for the traveling purchaser problem.
- Improved heuristics for the traveling purchaser problem.
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- The traveling salesman problem and its variations
- An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
- Approximate algorithms for the travelling purchaser problem
- Heuristics for the traveling purchaser problem
- The biobjective travelling purchaser problem
- Dynamic tabu search strategies for the traveling purchaser problem
- An exact algorithm for the capacitated total quantity discount problem
- The distance constrained multiple vehicle traveling purchaser problem
- Ant colony optimization for the traveling purchaser problem
- Vehicle Routing
- Beyond the flow decomposition barrier
- Integer Programming Formulation of Traveling Salesman Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Automatic production planning of press brakes for sheet metal bending
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- A new approach to the maximum-flow problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Maximum matching and a polyhedron with 0,1-vertices
- The Traveling Salesman Problem: A Survey
- Sequencing many jobs on a multi-purpose facility
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Effective Algorithms for a Bounded Version of the Uncapacitated TPP
