Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Publication

Vehicle routing with cross-dock selection

Mohammad Yousef Maknoon
2016
Journal Articles

Abstract

The vehicle routing problem with cross-dock selection is a variant of the vehicle routing problem containing spatial and load synchronization constraints by which products are transferred and processed via at least one cross-dock. This paper presents a mathematical formulation of the problem and an adaptive large neighborhood search heuristic. Computational experiments on a set of benchmark instances demonstrate the efficiency of the proposed methodology. (C) 2016 Elsevier Ltd. All rights reserved.

Official source

https://infoscience.epfl.ch/entities/publication/2fd6f400-e9e2-4a8a-bdec-d754a1e268ea

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Mohammad Yousef Maknoon
2016
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/2fd6f400-e9e2-4a8a-bdec-d754a1e268ea

About this result

Related concepts (9)

Vehicle routing problem

The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?" It generalises the travelling salesman problem (TSP). It first appeared in a paper by George Dantzig and John Ramser in 1959, in which the first algorithmic approach was written and was applied to petrol deliveries. Often, the context is that of delivering goods located at a central depot to customers who have placed orders for such goods.

Arc routing

Arc routing problems (ARP) are a category of general routing problems (GRP), which also includes node routing problems (NRP). The objective in ARPs and NRPs is to traverse the edges and nodes of a graph, respectively. The objective of arc routing problems involves minimizing the total distance and time, which often involves minimizing deadheading time, the time it takes to reach a destination.

Computational physics

Computational physics is the study and implementation of numerical analysis to solve problems in physics. Historically, computational physics was the first application of modern computers in science, and is now a subset of computational science. It is sometimes regarded as a subdiscipline (or offshoot) of theoretical physics, but others consider it an intermediate branch between theoretical and experimental physics - an area of study which supplements both theory and experiment.

Related publications (39)

Vehicle routing with cross-dock selection

Graph Chatbot

Effects of physiotherapy and home-based training in parkinsonian syndromes: protocol for a randomised controlled trial (MobilityAPP)

On improving the efficiency of modifier adaptation via directional information

The domain of definition of the Levy white noise