A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization

DOI10.1007/S11067-017-9364-ZzbMath1392.90009OpenAlexW2755913316MaRDI QIDQ1654574

Y. Aharonov

Publication date: 8 August 2018

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-017-9364-z

zbMATH Keywords

transportationcompetitive environmenttime dependent vehicle routing problemmodified random topology particle swarm optimization

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Retail store location and pricing within a competitive environment using constrained multinomial logit ⋮ A game-theoretic approach to the freight transportation pricing problem in the presence of intermodal service providers in a competitive market ⋮ Omni-channel product distribution network design by using the improved particle swarm optimization algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
• A new formulation approach for location-routing problems
• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
• Inter-school bus scheduling under stochastic travel times
• Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows
• Survey of multi-objective optimization methods for engineering
• Processing time-dependent shortest path queries without pre-computed speed information on road networks
• A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
• A linearization method for mixed 0--1 polynomial programs
• Vehicle dispatching with time-dependent travel times
• A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
• The shortest route through a network with time-dependent internodal transit times
• The Truck Dispatching Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Particle Swarm Optimization
• Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Constructing Maximal Dynamic Flows from Static Flows

This page was built for publication: A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization