The traveling purchaser problem with fast service option
From MaRDI portal
Publication:2669765
DOI10.1016/J.COR.2022.105700OpenAlexW4205857536MaRDI QIDQ2669765FDOQ2669765
Authors: İlker Küçükoğlu 
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105700
Recommendations
combinatorial optimizationmeta-heuristicsadaptive large neighborhood searchtraveling purchaser problem
Cites Work
- Integer Programming Formulation of Traveling Salesman Problems
- A general heuristic for vehicle routing problems
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- Travelling purchaser problem
- Models for a traveling purchaser problem with additional side-constraints
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Vehicle Routing
- Routing a mixed fleet of electric and conventional vehicles
- Computer Solutions of the Traveling Salesman Problem
- The traveling purchaser problem with budget constraint
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
- Dynamic tabu search strategies for the traveling purchaser problem
- The distance constrained multiple vehicle traveling purchaser problem
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- A column generation approach for a school bus routing problem with resource constraints
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- Exploring greedy criteria for the dynamic traveling purchaser problem
- Transgenetic algorithm for the traveling purchaser problem
- A branch and bound algorithm for the traveling purchaser problem
- Improved solutions for the traveling purchaser problem.
- The bi-objective traveling purchaser problem with deliveries
- Approximate algorithms for the travelling purchaser problem
- Heuristics for the traveling purchaser problem
- The biobjective travelling purchaser problem
- Ant colony optimization for the traveling purchaser problem
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
- A heuristic approach for the travelling purchaser problem
- Solving the asymmetric traveling purchaser problem
- An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
- The traveling purchaser problem and its variants
- Title not available (Why is that?)
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms
- Improved heuristics for the traveling purchaser problem.
- Metaheuristics based on decision hierarchies for the traveling purchaser problem
- The traveling purchaser problem with time-dependent quantities
- An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
- A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
Cited In (7)
- Models for a traveling purchaser problem with additional side-constraints
- Exploring greedy criteria for the dynamic traveling purchaser problem
- A heuristic approach for the travelling purchaser problem
- The traveling purchaser problem and its variants
- Utilizing multi-vehicle traveling purchaser problem for multiple-supplier selection and multi-period lot-sizing in a fuzzy demand environment
- The bi-objective traveling purchaser problem with deliveries
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants
Uses Software
This page was built for publication: The traveling purchaser problem with fast service option
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669765)
