The bi-objective insular traveling salesman problem with maritime and ground transportation costs
From MaRDI portal
Publication:1653384
DOI10.1016/j.ejor.2018.05.009zbMath1403.90149MaRDI QIDQ1653384
Carlos Obreque, Pablo A. Miranda, Javier Maturana-Ross, Carola A. Blazquez, Gabriel Gutiérrez-Jarpa
Publication date: 3 August 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.009
traveling salesman; bi-objective transportation costs; ground transportation costs; island freight collection or distribution; selective and generalized vehicle routing problems
90C35: Programming involving graphs or networks
90C29: Multi-objective and goal programming
90B06: Transportation, logistics and supply chain management
90C27: Combinatorial optimization
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
- Hybrid metaheuristics for the clustered vehicle routing problem
- Route planning for a seaplane service: the case of the Greek islands
- Multiobjective vehicle routing problem with fixed delivery and optional collections
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- Generalized network design problems. Modeling and optimization.
- The orienteering problem: a survey
- Travel time reliability in vehicle routing and scheduling with time windows
- The selective travelling salesman problem
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- The team orienteering problem
- A review of extensive facility location in networks
- Ship scheduling: The last decade
- The median tour and maximal covering tour problems: Formulations and heuristics
- Covering a graph with cycles.
- A two-level solution approach for solving the generalized minimum spanning tree problem
- The traveling purchaser problem and its variants
- The set orienteering problem
- The vehicle routing-allocation problem: A unifying framework
- The biobjective travelling purchaser problem
- Locating median cycles in networks
- Routing problems: A bibliography
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- Optimal solutions for routing problems with profits
- A review of dynamic vehicle routing problems
- The bi-objective pollution-routing problem
- Ship routing and scheduling in the new millennium
- New mathematical models of the generalized vehicle routing problem and extensions
- Complexity and approximation for traveling salesman problems with profits
- The single vehicle routing problem with deliveries and selective pickups
- A genetic algorithm for a bi-objective capacitated arc routing problem
- Metaheuristics and cooperative approaches for the bi-objective ring star problem
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
- A combined ship scheduling and allocation problem
- A tabu search algorithm for the single vehicle routing allocation problem
- The Period Vehicle Routing Problem and its Extensions
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- The orienteering problem
- Some Applications of the Generalized Travelling Salesman Problem
- Solving the Orienteering Problem through Branch-and-Cut
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Some applications of the clustered travelling salesman problem
- Exact Algorithms for the Clustered Vehicle Routing Problem
- Exploiting Erraticism in Search
- Ship scheduling with soft time windows: An optimisation based approach
