The bi-objective Dial-a-Tour problem

DOI10.1007/S40590-026-00960-8MaRDI QIDQ7397461zbMATH OpenFDO

Authors Vincent Boyer, Oscar Alejandro Hernández-López, Jobish Vallikavungal, María Angélica Salazar-Aguilar

Publication date 2025

Published in Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40590-026-00960-8

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Mixed integer programming (90C11) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• A survey on multi-objective evolutionary algorithms for many-objective problems
• Advances in multi-objective nature inspired computing
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Objectives and methods in multi-objective routing problems: a survey and classification scheme
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The dial-a-tour problem
• The truck dispatching problem
• The vehicle routing problem with backhauls
• Variable neighborhood search for the dial-a-ride problem
• Vehicle routing problems with split deliveries

This page was built for publication: The bi-objective Dial-a-Tour problem

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