A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment

DOI10.1007/S40314-016-0410-0MaRDI QIDQ725797zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

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

zbMATH Keywords

local multi-objective particle swarm optimizationmulti-objective optimizationperiodic vehicle routing problemuncertain competitive environment

Mathematics Subject Classification ID

Randomized algorithms (68W20) Transportation, logistics and supply chain management (90B06) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands
• A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority
• The period vehicle routing problem and its extensions
• The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: two robust bi-objective models
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem
• The periodic vehicle routing problem with driver consistency
• The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms
• Robust multiperiod vehicle routing under customer order uncertainty

Cites work

• 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 Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• A unified tabu search heuristic for vehicle routing problems with time windows
• A variable neighborhood search heuristic for periodic routing problems
• A Vehicle Routing Problem with Stochastic Demand
• An application of special ordered sets to a periodic milk collection problem
• An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• An integer L-shaped method for the generalized vehicle routing problem with stochastic demands
• Delivery strategies for blood products supplies
• Forty years of periodic vehicle routing
• Further results on the probabilistic traveling salesman problem
• Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
• Multi-objective vehicle routing problems
• Networks and vehicle routing for municipal waste collection
• On a periodic vehicle routing problem
• Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
• Performance measures for dynamic multi-objective optimisation algorithms
• Solving An Integrated Logistics Problem Arising In Grocery Distribution
• Stochastic vehicle routing: A comprehensive approach
• The period routing problem
• The Vehicle Routing Problem with Stochastic Travel Times
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem

Cited in

(4)

• A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization
• A bi-level model and memetic algorithm for arc interdiction location-routing problem
• A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
• Territorial design for customers with demand frequency

This page was built for publication: A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725797)