A biased random-key genetic algorithm for the set orienteering problem
From MaRDI portal
Publication:2030452
DOI10.1016/j.ejor.2020.11.043zbMath1487.90616OpenAlexW3112292673MaRDI QIDQ2030452
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.11.043
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
An adaptive memory matheuristic for the set orienteering problem ⋮ The capacitated family traveling salesperson problem ⋮ Spatial coverage in routing and path planning problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The clustered orienteering problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- A fast and effective heuristic for the orienteering problem
- Evolution strategies. A comprehensive introduction
- A novel discretization scheme for the close enough traveling salesman problem
- Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- A new load balance methodology for container loading problem in road transportation
- The set orienteering problem
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints
- A biased random-key genetic algorithm for single-round divisible load scheduling
- Vehicle Routing
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
- The Multiple-Choice Knapsack Problem
- Some Applications of the Generalized Travelling Salesman Problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Randomized heuristics for the family traveling salesperson problem
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
- A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
- Metaheuristics based on decision hierarchies for the traveling purchaser problem
This page was built for publication: A biased random-key genetic algorithm for the set orienteering problem
