The risk-averse traveling repairman problem with profits
From MaRDI portal
Publication:2317622
DOI10.1007/s00500-018-3660-5zbMath1418.90066OpenAlexW2903455153WikidataQ128849872 ScholiaQ128849872MaRDI QIDQ2317622
Roberto Musmanno, Demetrio Laganà, Patrizia Beraldi, Maria Elena Bruni
Publication date: 12 August 2019
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-018-3660-5
Related Items (7)
A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones ⋮ The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times ⋮ Hybrid evolutionary search for the traveling repairman problem with profits ⋮ Solving the traveling repairman problem with profits: a novel variable neighborhood search approach ⋮ A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits ⋮ A metaheuristic for the delivery man problem with time windows ⋮ Special issue on: Optimization methods for decision making: advances and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Solving the traveling repairman problem on a line with general processing times and deadlines
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
- Heuristics for the traveling repairman problem with profits
- A beam search approach to the container loading problem
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- The robust vehicle routing problem with time windows
- Capital rationing problems under uncertainty and risk
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- On solving the assembly line worker assignment and balancing problem via beam search
- Travel time reliability in vehicle routing and scheduling with time windows
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- Vehicle routing with stochastic time-dependent travel times
- Convexity of chance constraints with independent random variables
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- On distributionally robust chance-constrained linear programs
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- The mixed capacitated general routing problem under uncertainty
- Routing Optimization Under Uncertainty
- Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands
- The Machine Learning and Traveling Repairman Problem
- Layered Formulation for the Robust Vehicle Routing Problem with Time Windows
- The Probabilistic Set-Covering Problem
- The Vehicle Routing Problem with Stochastic Travel Times
- The Delivery Man Problem and Cumulative Matroids
- Introduction to Stochastic Programming
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Time‐dependent traveling salesman problem–the deliveryman case
- A stochastic programming approach for the traveling purchaser problem
- A progressive hedging method for the multi-path travelling salesman problem with stochastic travel times
- Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem
This page was built for publication: The risk-averse traveling repairman problem with profits
