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

DOI10.1016/J.EJOR.2015.06.073zbMATH Open1346.90112OpenAlexW1428828117MaRDI QIDQ320623FDOQ320623

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

Recommendations

• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
• The distance constrained multiple vehicle traveling purchaser problem
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
• Pickup and delivery problem with incompatibility constraints
• Solving the asymmetric traveling purchaser problem

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)

Cites Work

• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Shortest Path Problems with Resource Constraints
• Routing problems with loading constraints
• Stabilized column generation
• Heuristics and lower bounds for the bin packing problem with conflicts
• Branch-and-price: Column generation for solving huge integer programs
• Decomposition Principle for Linear Programs
• The transportation problem with exclusionary side constraints
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
• Interior point stabilization for column generation
• Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
• Solving the Orienteering Problem through Branch-and-Cut
• Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems
• A column generation approach for the split delivery vehicle routing problem
• The traveling purchaser problem with budget constraint
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
• Dynamic tabu search strategies for the traveling purchaser problem
• The distance constrained multiple vehicle traveling purchaser problem
• Title not available (Why is that?)
• A column generation approach for a school bus routing problem with resource constraints
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• A stochastic programming approach for the traveling purchaser problem
• Exploring greedy criteria for the dynamic traveling purchaser problem

Cited In (25)

• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
• Solving the set covering problem with conflicts on sets: a new parallel GRASP
• Vehicle routing problems with multiple commodities: a survey
• Pickup and delivery problem with incompatibility constraints
• Mathematical models for a ship routing problem with a small number of ports on a route
• New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty
• An exact algorithm for parallel machine scheduling with conflicts
• The directed profitable rural postman problem with incompatibility constraints
• Optimization of logistics services in hospitals
• 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 identical jobs on uniform machines with a conflict graph
• The undirected capacitated general routing problem with profits
• Scheduling on uniform machines with a conflict graph: complexity and resolution
• The traveling purchaser problem with fast service option
• Branch-and-price approaches for the multiperiod technician routing and scheduling problem
• Solving the team orienteering problem with cutting planes
• Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
• Formulations for the orienteering problem with additional constraints
• The traveling purchaser problem and its variants
• Utilizing multi-vehicle traveling purchaser problem for multiple-supplier selection and multi-period lot-sizing in a fuzzy demand environment
• The bi-objective traveling purchaser problem with deliveries
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order

Uses Software

• LKH

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320623)