A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
From MaRDI portal
Publication:264238
DOI10.1007/s11067-011-9169-4zbMath1332.90358OpenAlexW2042056082MaRDI QIDQ264238
F. Blanchet-Sadri, M. Dambrine
Publication date: 31 March 2016
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-011-9169-4
particle swarm optimizationcompetitive environmentmulti-objective modelNSGA-IIopen vehicle routing problem
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
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, Sustainability SI: logistics cost and environmental impact analyses of urban delivery consolidation strategies, An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot, A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times, A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization, Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution, Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation, Responsive and reliable injured-oriented blood supply chain for disaster relief: a real case study, Efficient insertion heuristic algorithms for multi-trip inventory routing problem with time windows, shift time limits and variable delivery time, A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment, A game-theoretic approach to the freight transportation pricing problem in the presence of intermodal service providers in a competitive market
Uses Software
Cites Work
- Unnamed Item
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- A tabu search algorithm for the open vehicle routing problem
- Mixed route strategies for the risk-averse shipment of hazardous materials
- Travel time reliability in vehicle routing and scheduling with time windows
- Optimal routing for maximizing the travel time reliability
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- A hybrid evolution strategy for the open vehicle routing problem
- A linearization method for mixed 0--1 polynomial programs
- An evolutionary algorithm for the vehicle routing problem with route balancing
- A variable neighbourhood search algorithm for the open vehicle routing problem
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
- An efficient method for solving linear goal programming problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A heuristic method for the open vehicle routing problem
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- A new tabu search heuristic for the open vehicle routing problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The open vehicle routing problem with time windows
- Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
- A threshold accepting approach to the Open Vehicle Routing problem
