A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization
type: Item
instance of: scholarly article
title: A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization
zbMATH Open document ID: 1392.90009
author: Y. Aharonov
published in: Networks and Spatial Economics
publication date: 2018-08-08T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6914931
zbMATH Keywords: transportation
zbMATH Keywords: time dependent vehicle routing problem
zbMATH Keywords: competitive environment
zbMATH Keywords: modified random topology particle swarm optimization
MaRDI profile type: Publication
full work available at URL: s11067-017-9364-z
OpenAlex ID: W2755913316
cites work: A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
cites work: A linearization method for mixed 0--1 polynomial programs
cites work: Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
cites work: A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times
cites work: Particle Swarm Optimization
cites work: The shortest route through a network with time-dependent internodal transit times
cites work: The truck dispatching problem
cites work: Constructing Maximal Dynamic Flows from Static Flows
cites work: Q4811640
cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
cites work: Q4039765
cites work: Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
cites work: Vehicle dispatching with time-dependent travel times
cites work: Processing time-dependent shortest path queries without pre-computed speed information on road networks
cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
cites work: Survey of multi-objective optimization methods for engineering
cites work: Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows
cites work: A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
cites work: A new formulation approach for location-routing problems
cites work: Inter-school bus scheduling under stochastic travel times
cites work: A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
DOI: 10.1007/S11067-017-9364-Z
description: scientific article; zbMATH DE number 6914931