Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case

DOI10.1007/s11067-017-9367-9OpenAlexW2759876802MaRDI QIDQ2005780

Haluk Yapicioglu

Publication date: 8 October 2020

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-017-9367-9

zbMATH Keywords

simulated annealingtime windowsmulti traveling salesmen problemrobust tabu search

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Uses Software

• Tabu search
• A-RESCUE

Cites Work

• Optimization by Simulated Annealing
• A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
• Modelization of time-dependent urban freight problems by using a multiple number of distribution centers
• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
• Inter-school bus scheduling under stochastic travel times
• Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations
• Optimal information location for adaptive routing
• Travel time reliability in vehicle routing and scheduling with time windows
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
• Multicriteria stochastic shortest path problem for electric vehicles
• Future paths for integer programming and links to artificial intelligence
• The electric vehicle shortest-walk problem with battery exchanges
• Finding efficient and environmentally friendly paths for risk-averse freight carriers
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
• A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times
• Path flow and trip matrix estimation using link flow density
• A-RESCUE: an agent based regional evacuation simulator coupled with user enriched behavior
• Path flow estimator in an entropy model using a nonlinear L-shaped algorithm
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• Integer linear programming formulations of multiple salesman problems and its variations
• Integer Programming Formulation of Traveling Salesman Problems
• Tabu Search—Part I
• Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
• Tabu Search—Part II
• Reducibility among Combinatorial Problems
• Solution of a Large-Scale Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case