Time‐dependent traveling salesman problem–the deliveryman case
From MaRDI portal
Publication:4712107
DOI10.1002/net.3230200605zbMath0744.90063OpenAlexW2056425817MaRDI QIDQ4712107
Publication date: 25 June 1992
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230200605
Programming involving graphs or networks (90C35) Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem, Heuristics for the traveling repairman problem with profits, An integer programming approach for the time-dependent traveling salesman problem with time windows, A branch-and-price algorithm for the minimum latency problem, Routing problems: A bibliography, The arc-item-load and related formulations for the cumulative vehicle routing problem, A comparison of three metaheuristics for the workover rig routing problem, A simple and effective metaheuristic for the minimum latency problem, A classification of formulations for the (time-dependent) traveling salesman problem, Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery, Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem, Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining, A branch-and-bound approach for a vehicle routing problem with customer costs, The Surgical Patient Routing Problem: A Central Planner Approach, A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, The delivery man problem with time windows, The time dependent traveling salesman problem: polyhedra and algorithm, Solving the continuous flow-shop scheduling problem by metaheuristics., Natural and extended formulations for the time-dependent traveling salesman problem, A comparison of algorithms for finding an efficient theme park tour, The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times, Hybrid optimization methods for time-dependent sequencing problems, Scheduling examinations to reduce second-order conflicts, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, A dynamic vehicle routing problem with time-dependent travel times, Facets and valid inequalities for the time-dependent travelling salesman problem, A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits, A new formulation for the traveling deliveryman problem, The risk-averse traveling repairman problem with profits, An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem, The multi-depot \(k\)-traveling repairman problem, A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem, Solving the traveling delivery person problem with limited computational time
