The bi-objective traveling purchaser problem with deliveries

DOI10.1016/j.ejor.2018.08.039zbMath1403.90655OpenAlexW2889309367MaRDI QIDQ1622816

M. Angélica Salazar-Aguilar, Pamela J. Palomo-Martínez

Publication date: 19 November 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.08.039

zbMATH Keywords

metaheuristicsvariable neighborhood searchtraveling purchaser problembi-objective optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

The traveling purchaser problem with fast service option ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants ⋮ A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem

Uses Software

• SPEA2
• SSPMO

Cites Work

• Unnamed Item
• Unnamed Item
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
• A column generation approach for a school bus routing problem with resource constraints
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms
• Exploring greedy criteria for the dynamic traveling purchaser problem
• A heuristic approach for the travelling purchaser problem
• Models for a traveling purchaser problem with additional side-constraints
• Principles and practice of constraint programming. 18th international conference, CP 2012, Québec City, QC, Canada, October 8--12, 2012. Proceedings
• Solving the asymmetric traveling purchaser problem
• The traveling purchaser problem with budget constraint
• Transgenetic algorithm for the traveling purchaser problem
• Travelling purchaser problem
• A branch and bound algorithm for the traveling purchaser problem
• Improved solutions for the traveling purchaser problem.
• Improved heuristics for the traveling purchaser problem.
• The traveling purchaser problem with time-dependent quantities
• The traveling purchaser problem and its variants
• An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
• Approximate algorithms for the travelling purchaser problem
• Heuristics for the traveling purchaser problem
• The biobjective travelling purchaser problem
• Dynamic tabu search strategies for the traveling purchaser problem
• The distance constrained multiple vehicle traveling purchaser problem
• Ant colony optimization for the traveling purchaser problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• Metaheuristics based on decision hierarchies for the traveling purchaser problem
• A Method for Solving Traveling-Salesman Problems
• A stochastic programming approach for the traveling purchaser problem
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization

This page was built for publication: The bi-objective traveling purchaser problem with deliveries