A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization
From MaRDI portal
(Redirected from Publication:1654574)
Recommendations
- A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
- Time dependent vehicle routing problem with a multi ant colony system
- Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption
- A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment
- A particle swarm optimisation for time-dependent vehicle routing problem with an efficient travel time function
Cites work
- A linearization method for mixed 0--1 polynomial programs
- A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times
- A new formulation approach for location-routing problems
- A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Constructing maximal dynamic flows from static flows
- scientific article; zbMATH DE number 192876 (Why is no real title available?)
- scientific article; zbMATH DE number 2096871 (Why is no real title available?)
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
- Inter-school bus scheduling under stochastic travel times
- Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
- Particle Swarm Optimization
- Processing time-dependent shortest path queries without pre-computed speed information on road networks
- Survey of multi-objective optimization methods for engineering
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The shortest route through a network with time-dependent internodal transit times
- The truck dispatching problem
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Vehicle dispatching with time-dependent travel times
Cited in
(6)- 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
- Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption
- A particle swarm optimisation for time-dependent vehicle routing problem with an efficient travel time function
- A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
This page was built for publication: A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1654574)
