Optimal solutions for routing problems with profits

DOI10.1016/J.DAM.2011.12.021MaRDI QIDQ1941380zbMATH OpenOpenAlexFDO

Authors C. Archetti, Nicola Bianchessi, Maria Grazia Speranza

Publication date 12 March 2013

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2011.12.021

zbMATH Keywords

branch-and-pricecapacitated profitable tour problemcapacitated team orienteering problemheuristicprofitsrouting

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An exact algorithm for team orienteering problems
• The capacitated team orienteering problem: a bi-level filter-and-fan method
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• A branch-and-cut algorithm for the team orienteering problem
• The team orienteering problem: formulations and branch-cut and price

Cited in

(34)

• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs
• The vehicle routing problem with service level constraints
• Formulations for the orienteering problem with additional constraints
• The undirected capacitated general routing problem with profits
• Approximation algorithms for some extensions of the maximum profit routing problem
• A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit
• A generic exact solver for vehicle routing and related problems
• The capacitated team orienteering problem: a bi-level filter-and-fan method
• Directed weighted improper coloring for cellular channel allocation
• The distance constrained multiple vehicle traveling purchaser problem
• A branch-and-cut algorithm for the capacitated profitable tour problem
• The multi-vehicle profitable pickup and delivery problem
• Optimal duty rostering for toll enforcement inspectors
• An exact algorithm for team orienteering problems
• A survey on matheuristics for routing problems
• A hybrid metaheuristic for smart waste collection problems with workload concerns
• Trip planning for visitors in a service system with capacity constraints
• Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem
• The split delivery capacitated team orienteering problem
• An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
• Orienteering problem: a survey of recent variants, solution approaches and applications
• The dynamic multiperiod vehicle routing problem with probabilistic information
• Optimal interval scheduling with a resource constraint
• Solving the orienteering problem with time windows via the pulse framework
• The capacitated team orienteering problem with incomplete service
• On finding a cyclic tour and a vehicle loading plan yielding maximum profit
• scientific article; zbMATH DE number 6741969 (Why is no real title available?)
• A matheuristic for the split delivery capacitated profitable tour problem with incomplete service
• Branch-and-cut-and-price for agile Earth observation satellite scheduling
• Capacitated profitable tour problem with cross-docking
• A tutorial on Branch-Price-and-Cut algorithms

This page was built for publication: Optimal solutions for routing problems with profits

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