The biobjective travelling purchaser problem

DOI10.1016/J.EJOR.2003.10.003zbMath1061.90065OpenAlexW2170849295MaRDI QIDQ1885751

Jorge Riera-Ledesma, Juan-José Salazar-González

Publication date: 12 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.10.003

zbMATH Keywords

Combinatorial optimizationTravelling salesmanMultiple criteria analysis

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27)

Related Items (15)

The bi-objective traveling purchaser problem with deliveries ⋮ Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ Exact algorithms for bi-objective ring tree problems with reliability measures ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ An exact algorithm for biobjective integer programming problems ⋮ The traveling purchaser problem with fast service option ⋮ From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods ⋮ An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits ⋮ The traveling purchaser problem and its variants ⋮ Multi-objective vehicle routing problems ⋮ An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem ⋮ The traveling purchaser problem with budget constraint ⋮ Effective Algorithms for a Bounded Version of the Uncapacitated TPP

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Travelling purchaser problem
• Introduction to ABACUS -- a branch-and-cut system
• A branch and bound algorithm for the traveling purchaser problem
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Improved solutions for the traveling purchaser problem.
• Multicriteria optimization
• Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
• Approximate algorithms for the travelling purchaser problem
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Algorithms for solving the two-criterion large-scale travelling salesman problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• Sequencing many jobs on a multi-purpose facility
• Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry

This page was built for publication: The biobjective travelling purchaser problem