Search Results

This paper studies a delivery problem in a pharmaceutical cold chain. In this problem, each customer orders multiple pharmaceutical products and requires a due date for each order. Each product has sensitive characteristics of storage temperature ...

• The addressed problem is formulated as a mixed integer linear programming model.
• An effective genetic algorithm is proposed to efficiently solve the optimization model.
• The managerial insights of the order acceptance strategy are ...

Responding to e-commerce orders as quickly as possible is indispensable for companies competing in the current retailing landscape. After a customer orders online, the requested items should be picked in the warehouse and delivered to the ...

• The integration of order picking and vehicle routing decisions is studied.
• A mathematical formulation for the integration of picking and routing is proposed.
• An online metaheuristic algorithm, considering dynamic order arrivals, is ...

The split delivery vehicle routing problem with three-dimensional loading constraints (3L-SDVRP) intertwines complex routing and packing challenges. The current study addresses 3L-SDVRP using intelligent optimization algorithms, which iteratively ...

In this paper, a two-agent heterogeneous fleet vehicle routing problem with time windows (TAHF_VRPTW) is considered. The objective of the first agent is to minimize the total tardiness and the objective of the second agent is to minimize the total ...

We develop theoretical foundations and practical algorithms for vehicle routing with time-dependent travel times. We also provide new benchmark instances and experimental results.

First, we study basic operations on piecewise linear arrival time ...

In the aerial pickup and delivery of goods in a distribution network, transport aviation faces risks of load imbalance due to the urgency required for loading, immediate take-off, and mission accomplishment. Transport planners deal with trip ...

• Original modelling of a real air cargo transportation problem.
• Its description simultaneously involves four NP-hard sub-problems.
• Objective is to maximize transport of priority items and minimize consumed fuel.
• Its output ...

This paper focuses on a NP-Hard vehicle routing problem with profits, and presents a hybrid heuristic solution approach for the Capacitated Team Orienteering Problem (CTOP), which is a variant of the well-known team orienteering problem. In the ...

• We propose an efficient hybrid heuristic for the Capacitated Team Orienteering Problem.
• Our heuristic method is based on an adaptive large neighborhood search.
• The proposed heuristic identifies most of the best-known solutions.

Hyper-heuristics are general purpose search methods for solving computationally difficult problems. A selection hyper-heuristic is composed of two key components: a heuristic selection method and move acceptance criterion. Under an iterative ...

We consider range minimization problems featuring exponentially many variables, as frequently arising in fairness-oriented or bi-objective optimization. While branch-and-price is successful at solving cost-oriented problems with many variables, ...

This paper studies the Hierarchical Multi-Switch Multi-Echelon VRP (HMSME-VRP), a newly introduced VRP variant based on a real-world case involving High Capacity Vehicles (HCV). The problem originates from the policies of a distribution company ...

• A real-world VRP variant originating from a Nordic distribution company is presented.
• It is solved by two versions of a GVNS algorithm; a conventional and one adaptive.
• 48 new benchmark instances are derived in order to test the ...

Consolidation of commodities and coordination of vehicle routes are fundamental features of supply chain management problems. While locations for consolidation and coordination are typically known a priori, in adaptive transportation networks ...

• A mathematical formulation combining clustering with local and long haul routing.
• Combines exact and heuristic methods to solve the proposed relaxation of the SCSNDP.
• Develops a parallel heuristic that finds high quality solutions ...

Demand for delivery of take-away meals to customers has been growing worldwide, with deliveries often performed by non-specialised gig economy couriers working for online platform operators such as Deliveroo or Just Eat. This has led to the ...

• In this work we highlight the need for creating fairer shifts for Gig economy workers.
• We explore a new model to address the fairness in the meal delivery problem.
• We develop some simple and effective heuristics to solve large ...

This paper aims to investigate the vehicle routing problem faced by a logistics service provider that performs the last-mile delivery of large household appliances under the front warehouse mode for multiple enterprises. We formulate the problem ...

• A last-mile delivery vehicle routing problem in front warehouse mode is introduced.
• A mixed integer programming formulation is proposed.
• Two heuristic methods with specially designed move operators are developed.

In this paper, the Hierarchical Multi Switch Multi Echelon Vehicle Routing Problem with Service Times (HMSME-VRP-ST) is presented. This novel problem considers distribution applications in which goods are delivered either directly from a central ...

• A mathematical formulation of the HMSME-VRP-ST is presented and described in detail.
• New instances generated of clustered, random and mixed customer locations.
• Small instances solved with exact and metaheuristic methods.
• Four ...

Following the widespread interest of both the scientific community and companies in using autonomous vehicles to perform deliveries, we propose the ‘Drone-Assisted Vehicle Routing Problem with Robot Stations’ (VRPD-RS), a problem that combines ...

• This paper studies the ‘Drone-Assisted Vehicle Routing Problem with Robot Stations’ (VRPD-RS).
• We model the VRPD-RS as a mixed-integer linear program.
• We develop a General Variable Neighborhood Search (GVNS) algorithm to solve ...

This paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a TSP sequence as the representation of each individual, and a ...

• We propose a hybrid genetic algorithm for the Multiple Traveling Salesman Problem.
• We propose a novel crossover operator that is effective for the min–max problem.
• Our algorithm outperforms all existing algorithms on average.
• ...

This paper addresses integrated production and distribution scheduling problem in which orders/jobs are undergone a single operation on any one of the identical machines in parallel and upon the completion of the production they are distributed ...

In recent years, integrated production and distribution scheduling (IPDS) has received growing attention from academia and industry. With increasingly global economic activities, it is vital to extend IPDS to distributed environments. Besides, ...

• This work investigates an integrated distributed flow shop and distribution green scheduling problem.
• A multi-objective mixed integer programming model is provided to define the problem.
• A Q-learning-based multi-objective ...

Designing routing schedules is a pivotal aspect of smart delivery systems. Therefore, the field has been blooming for decades, and numerous algorithms for this task have been proposed for various formulations of rich vehicle routing problems. ...

This study proposes a new metaheuristic optimization algorithm, inspired by crabs mating in nature, with five versions. For these crab versions, first, the code of the crab mating optimization algorithm was written, inspired by Chifu’s crab mating ...