A multi-agent based cooperative approach to scheduling and routing
From MaRDI portal
Publication:323308
DOI10.1016/j.ejor.2016.02.045zbMath1346.90371OpenAlexW2290769714MaRDI QIDQ323308
Patrick Beullens, Angel A. Juan, Djamila Ouelhadj, Ender Özcan, Simon P. Martin, Edmund Kieran Burke
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.02.045
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (7)
A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains ⋮ Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery ⋮ A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands ⋮ On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs ⋮ Metaheuristics ``In the large ⋮ Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art ⋮ Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands
- Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism
- A cooperative hyper-heuristic search framework
- Cooperative metaheuristics for the permutation flowshop scheduling problem
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Benchmarks for basic scheduling problems
- COSEARCH: A parallel cooperative metaheuristic
- The Truck Dispatching Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
- A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
This page was built for publication: A multi-agent based cooperative approach to scheduling and routing