A bi-criteria moving-target travelling salesman problem under uncertainty

DOI10.1016/J.EJOR.2023.01.009MaRDI QIDQ6167752zbMATH OpenFDO

Authors Alaleh Maskooki, Markku Kallio

Publication date 10 July 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

zbMATH Keywords

dynamic programminginteger programmingstochastic programmingtravelling salesmanmoving target

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• A Dynamic Programming Approach to Sequencing Problems
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• A Vehicle Routing Problem with Stochastic Demand
• A customized genetic algorithm for bi-objective routing in a dynamic network
• A dynamic traveling salesman problem with stochastic arc costs
• A priori orienteering with time windows and stochastic wait times at customers
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
• Approximation results for kinetic variants of TSP
• Assessing the prediction uncertainty in a route optimization model for autonomous maritime logistics
• Bi-objective routing in a dynamic network: an application to maritime logistics
• Dealing with time in the multiple traveling salespersons problem with moving targets
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Dynamic traveling salesman problem with stochastic release dates
• EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM
• Evaluation of scenario generation methods for stochastic programming
• Frontiers of Stochastically Nondominated Portfolios
• Introduction to stochastic programming.
• Lectures on Stochastic Programming
• Linear programming under uncertainty
• On-orbit servicing: a time-dependent, moving-target traveling salesman problem
• Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands
• Robust drone selective routing in humanitarian transportation network assessment
• Robust optimization
• Routing of platforms in a maritime surface surveillance operation
• Single source single-commodity stochastic network design
• Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices
• Stochastic optimization models for a single-sink transportation problem
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The Vehicle Routing Problem with Stochastic Travel Times
• The moving-target traveling salesman problem
• The orienteering problem
• The prize collecting traveling salesman problem
• The single line moving target traveling salesman problem with release times
• The time dependent traveling salesman problem: polyhedra and algorithm
• The traveling salesman problem. A computational study.
• The travelling-salesman problem with moving objects
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• Time dependent vehicle routing problem with a multi ant colony system

Cited in

(2)

• Uncertain multiobjective traveling salesman problem
• Solution of uncertain constrained multi-objective travelling salesman problem with aspiration level based multi objective quasi oppositional Jaya algorithm

This page was built for publication: A bi-criteria moving-target travelling salesman problem under uncertainty

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