Optimizing logistics routings in a network perspective of supply and demand nodes
type: Item
instance of: scholarly article
title: Optimizing logistics routings in a network perspective of supply and demand nodes
author: Yanyan Li
published in: CEJOR. Central European Journal of Operations Research
publication date: 2021-06-16T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7360141
zbMATH Keywords: logistics planning
zbMATH Keywords: logistics scheduling
zbMATH Keywords: supply chain network
zbMATH Keywords: supply and demand
zbMATH Keywords: network theory
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10100-019-00653-w
OpenAlex ID: W2975501999
cites work: Multiple crossdocks with inventory and time windows
cites work: Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
cites work: The vehicle routing problem with coupled time windows
cites work: New assignment algorithms for the multi-depot vehicle routing problem
cites work: The vehicle routing problem. Latest advances and new challenges.
cites work: The vehicle routing problem with flexible time windows and traveling times
cites work: A queuing approach for inventory planning with batch ordering in multi-echelon supply chains
cites work: Logistics cost sharing in supply chains involving a third-party logistics provider
cites work: Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows
cites work: Vehicle routing with backhauls: review and research perspectives
cites work: A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
cites work: Location and lead-time perturbations in multi-level assembly systems of perishable goods in Spanish baby food logistics
cites work: Transshipment through crossdocks with inventory and time windows
cites work: Transshipment service through crossdocks with both soft and hard time windows
cites work: The periodic Vehicle routing problem: classification and heuristic
cites work: The transhipment problem
cites work: A review of dynamic vehicle routing problems
cites work: A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows
cites work: Comparing backhauling strategies in vehicle routing using ant colony optimization
cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
cites work: A unified heuristic for a large class of vehicle routing problems with backhauls
cites work: Hybrid approach of discrete event simulation integrated with location search algorithm in a cells assignment problem: a case study
cites work: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
cites work: Multimodal freight transportation planning: a literature review
cites work: Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
cites work: A memetic algorithm for a vehicle routing problem with backhauls
cites work: Heuristic approaches to vehicle routing with backhauls and time windows
cites work: Q4532230
cites work: Exact and hybrid methods for the multiperiod field service routing problem
cites work: Service network design for freight transportation: a review
cites work: Q4858101
Wikidata QID: Q127181189
DOI: 10.1007/S10100-019-00653-W
description: scientific article; zbMATH DE number 7360141