The biobjective travelling purchaser problem

DOI10.1016/J.EJOR.2003.10.003MaRDI QIDQ1885751zbMATH OpenOpenAlexFDO

Authors 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

Multiple criteria analysisCombinatorial optimizationTravelling salesman

Mathematics Subject Classification ID

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

Recommendations

• The bi-objective traveling purchaser problem with deliveries
• The traveling purchaser problem and its variants
• The traveling purchaser problem with budget constraint
• An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
• An evolutionary approach to generalized biobjective traveling salesperson problem
• The bi-objective covering tour problem
• The biobjective inventory routing problem -- problem solution and decision support
• Heuristics for the traveling purchaser problem
• Solving the asymmetric traveling purchaser problem
• scientific article; zbMATH DE number 1975100

Cites work

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 795217 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• 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
• A branch and bound algorithm for the traveling purchaser problem
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Algorithms for solving the two-criterion large-scale travelling salesman problem
• Approximate algorithms for the travelling purchaser problem
• Improved solutions for the traveling purchaser problem.
• Introduction to ABACUS -- a branch-and-cut system
• Multicriteria optimization
• Sequencing many jobs on a multi-purpose facility
• Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
• Travelling purchaser problem
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems

Cited in

(16)

• The traveling purchaser problem with fast service option
• The bi-objective traveling purchaser problem with deliveries
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• An exact algorithm for biobjective integer programming problems
• From single-objective to multi-objective vehicle routing problems: motivations, case studies, and methods
• Exact algorithms for bi-objective ring tree problems with reliability measures
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs
• The traveling purchaser problem with budget constraint
• Multi-objective vehicle routing problems
• An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
• Effective algorithms for a bounded version of the uncapacitated TPP
• The traveling purchaser problem and its variants
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits

Describes a project that uses

Uses Software

• ABACUS

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

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