A neural-tabu search heuristic for the real time vehicle routing problem
type: Item
instance of: scholarly article
title: A neural-tabu search heuristic for the real time vehicle routing problem
zbMATH Open document ID: 1140.90332
author: Jaber Jemai
author: Khaled Mellouli
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2008-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5287738
zbMATH Keywords: Real time vehicle routing
zbMATH Keywords: Artificial neural networks
zbMATH Keywords: Tabu search
describes a project that uses: GLPK
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: s10852-008-9082-0
OpenAlex ID: W2008088703
cites work: The Reactive Tabu Search
cites work: Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
cites work: A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
cites work: Stochastic and dynamic vehicle routing with general demand and interarrival time distributions
cites work: Neural networks and operations research: An overview
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Q4350081
cites work: Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
cites work: A user's guide to tabu search
cites work: Q2762577
cites work: Neural networks and physical systems with emergent collective computational abilities.
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Diversion issues in real-time vehicle dispatching
cites work: Self-organized formation of topologically correct feature maps
cites work: Self-organization and associative memory.
cites work: The dynamic multi-period vehicle routing problem
cites work: Q4889107
cites work: Neural network methods in combinatorial optimization
cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
cites work: Metaheuristics: A bibliography
cites work: A stochastic and dynamic routing policy using branching processes with state dependent immigration
cites work: State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
cites work: Dynamic vehicle routing: Status and prospects
cites work: Q4350082
cites work: Probabilistic diversification and intensification in local search for vehicle routing
cites work: Real-time decision problems: an operational research perspective
cites work: Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
cites work: A hybrid neural approach to combinatorial optimization
cites work: A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
cites work: Parallel iterative search methods for vehicle routing problems
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
DOI: 10.1007/S10852-008-9082-0
description: scientific article; zbMATH DE number 5287738