A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment
Publication:725797
DOI10.1007/S40314-016-0410-0zbMath1397.90049OpenAlexW2579508663MaRDI QIDQ725797
Publication date: 2 August 2018
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-016-0410-0
multi-objective optimizationperiodic vehicle routing problemlocal multi-objective particle swarm optimizationuncertain competitive environment
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20)
Related Items (2)
Cites Work
- A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
- An integer L-shaped method for the generalized vehicle routing problem with stochastic demands
- Performance measures for dynamic multi-objective optimisation algorithms
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
- Delivery strategies for blood products supplies
- Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
- An application of special ordered sets to a periodic milk collection problem
- 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
- Stochastic vehicle routing: A comprehensive approach
- Further results on the probabilistic traveling salesman problem
- A variable neighborhood search heuristic for periodic routing problems
- Multi-objective vehicle routing problems
- Forty years of periodic vehicle routing
- On a periodic vehicle routing problem
- The period routing problem
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- The Vehicle Routing Problem with Stochastic Travel Times
- Solving An Integrated Logistics Problem Arising In Grocery Distribution
- A unified tabu search heuristic for vehicle routing problems with time windows
- Networks and vehicle routing for municipal waste collection
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment