Optimal solutions for routing problems with profits

DOI10.1016/j.dam.2011.12.021zbMath1260.90156OpenAlexW2021360921MaRDI QIDQ1941380

Claudia Archetti, Maria Grazia Speranza, Nicola Bianchessi

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

heuristicbranch-and-priceroutingprofitscapacitated team orienteering problemcapacitated profitable tour problem

Mathematics Subject Classification ID

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

Related Items (21)

The multi-vehicle profitable pickup and delivery 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 ⋮ 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 ⋮ Optimal duty rostering for toll enforcement inspectors ⋮ The capacitated team orienteering problem with incomplete service ⋮ A hybrid metaheuristic for smart waste collection problems with workload concerns ⋮ The vehicle routing problem with service level constraints ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ Formulations for the orienteering problem with additional constraints ⋮ A generic exact solver for vehicle routing and related problems ⋮ Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem ⋮ Directed weighted improper coloring for cellular channel allocation ⋮ The distance constrained multiple vehicle traveling purchaser problem ⋮ A survey on matheuristics for routing problems ⋮ The split delivery capacitated team orienteering problem

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