The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach

DOI10.1016/j.ejor.2015.06.073zbMath1346.90112OpenAlexW1428828117MaRDI QIDQ320623

Daniele Manerba, Michel Gendreau, Renata Mansini

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.073

zbMATH Keywords

column generationbranch-and-pricemulti-vehiclepairwise incompatibility constraintstraveling purchaser problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (22)

The bi-objective traveling purchaser problem with deliveries ⋮ New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty ⋮ Solving the team orienteering problem with cutting planes ⋮ An exact algorithm for parallel machine scheduling with conflicts ⋮ Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint ⋮ Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order ⋮ The traveling purchaser problem with fast service option ⋮ Formulations for the orienteering problem with additional constraints ⋮ Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand ⋮ Minimum cost flow problem with conflicts ⋮ The family traveling salesman problem with incompatibility constraints ⋮ Scheduling on uniform machines with a conflict graph: complexity and resolution ⋮ Optimization of logistics services in hospitals ⋮ A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand ⋮ The traveling purchaser problem and its variants ⋮ Branch-and-price approaches for the multiperiod technician routing and scheduling problem ⋮ The undirected capacitated general routing problem with profits ⋮ The directed profitable rural postman problem with incompatibility constraints ⋮ Scheduling identical jobs on uniform machines with a conflict graph ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants ⋮ Pickup and delivery problem with incompatibility constraints ⋮ Mathematical models for a ship routing problem with a small number of ports on a route

Uses Software

• LKH

Cites Work

• Unnamed Item
• Unnamed Item
• A column generation approach for a school bus routing problem with resource constraints
• Routing problems with loading constraints
• Exploring greedy criteria for the dynamic traveling purchaser problem
• The traveling purchaser problem with budget constraint
• The transportation problem with exclusionary side constraints
• Stabilized column generation
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
• Heuristics and lower bounds for the bin packing problem with conflicts
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
• Dynamic tabu search strategies for the traveling purchaser problem
• The distance constrained multiple vehicle traveling purchaser problem
• Interior point stabilization for column generation
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• Decomposition Principle for Linear Programs
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• Solving the Orienteering Problem through Branch-and-Cut
• A stochastic programming approach for the traveling purchaser problem
• Shortest Path Problems with Resource Constraints
• A column generation approach for the split delivery vehicle routing problem

This page was built for publication: The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach