The bi-objective insular traveling salesman problem with maritime and ground transportation costs
type: Item
instance of: scholarly article
title: The bi-objective insular traveling salesman problem with maritime and ground transportation costs
zbMATH Open document ID: 1403.90149
author: Pablo A. Miranda
author: Carola A. Blazquez
author: Carlos Obreque
author: Javier Maturana-Ross
author: Gabriel Gutiérrez-Jarpa
published in: European Journal of Operational Research
publication date: 2018-08-03T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6913731
zbMATH Keywords: traveling salesman
zbMATH Keywords: island freight collection or distribution
zbMATH Keywords: ground transportation costs
zbMATH Keywords: bi-objective transportation costs
zbMATH Keywords: selective and generalized vehicle routing problems
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.05.009
OpenAlex ID: W2810555991
cites work: Travel time reliability in vehicle routing and scheduling with time windows
cites work: Complexity and approximation for traveling salesman problems with profits
cites work: Optimal solutions for routing problems with profits
cites work: The set orienteering problem
cites work: Multiobjective vehicle routing problem with fixed delivery and optional collections
cites work: Exact Algorithms for the Clustered Vehicle Routing Problem
cites work: The vehicle routing-allocation problem: A unifying framework
cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
cites work: The team orienteering problem
cites work: Ship routing and scheduling in the new millennium
cites work: Q3567139
cites work: The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
cites work: The median tour and maximal covering tour problems: Formulations and heuristics
cites work: The bi-objective pollution-routing problem
cites work: Ship scheduling with soft time windows: An optimisation based approach
cites work: A combined ship scheduling and allocation problem
cites work: Solving the Orienteering Problem through Branch-and-Cut
cites work: Exploiting Erraticism in Search
cites work: The Period Vehicle Routing Problem and its Extensions
cites work: Q4540081
cites work: Q3707760
cites work: The orienteering problem
cites work: The single vehicle routing problem with deliveries and selective pickups
cites work: A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
cites work: An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
cites work: Route planning for a seaplane service: the case of the Greek islands
cites work: Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
cites work: The team orienteering problem with time windows: an LP-based granular variable neighborhood search
cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm
cites work: Locating median cycles in networks
cites work: Covering a graph with cycles.
cites work: A genetic algorithm for a bi-objective capacitated arc routing problem
cites work: Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
cites work: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
cites work: Some Applications of the Generalized Travelling Salesman Problem
cites work: The selective travelling salesman problem
cites work: Routing problems: A bibliography
cites work: Some applications of the clustered travelling salesman problem
cites work: Metaheuristics and cooperative approaches for the bi-objective ring star problem
cites work: The traveling purchaser problem and its variants
cites work: A review of extensive facility location in networks
cites work: A review of dynamic vehicle routing problems
cites work: Generalized network design problems. Modeling and optimization.
cites work: New mathematical models of the generalized vehicle routing problem and extensions
cites work: Q4649350
cites work: A two-level solution approach for solving the generalized minimum spanning tree problem
cites work: The biobjective travelling purchaser problem
cites work: Ship scheduling: The last decade
cites work: The orienteering problem: a survey
cites work: Hybrid metaheuristics for the clustered vehicle routing problem
cites work: A tabu search algorithm for the single vehicle routing allocation problem
DOI: 10.1016/J.EJOR.2018.05.009
description: scientific article; zbMATH DE number 6913731