A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
From MaRDI portal
Publication:264238
DOI10.1007/S11067-011-9169-4zbMATH Open1332.90358OpenAlexW2042056082MaRDI QIDQ264238FDOQ264238
Authors: N. Norouzi, R. Tavakkoli-Moghaddam, M. Ghazanfari, M. Alinaghian, A. Salamatbakhsh 
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
Recommendations
- A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment
- A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization
- A particle swarm optimisation for vehicle routing problem with time windows
- Based on the open vehicle routing problem algorithm improved glowworm swarm optimization
- A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows
particle swarm optimizationcompetitive environmentmulti-objective modelNSGA-IIopen vehicle routing problem
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- 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
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- 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
- Title not available (Why is that?)
- 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
- 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
Cited In (15)
- A game-theoretic approach to the freight transportation pricing problem in the presence of intermodal service providers in a competitive market
- 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
- 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 novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization
- Sustainability SI: logistics cost and environmental impact analyses of urban delivery consolidation strategies
- Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation
- Title not available (Why is that?)
- An attractors-based particle swarm optimization for multiobjective capacitated vehicle routing problem
- A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times
- Responsive and reliable injured-oriented blood supply chain for disaster relief: a real case study
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution
- An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
Uses Software
This page was built for publication: A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264238)
