On the public citation graph

A Large Neighborhood Decomposition Search-Based Approach for the Location-Routing Problem with Pickup Facilities and Heterogeneous Demands

https://doi.org/10.2139/ssrn.5159392
0 signed · 64 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-030-51828-8_46openalex-snapshot
Research on Availability of Intelligent Express Cabinet Service System
inferredcites →https://doi.org/10.1007/978-3-642-29124-1_2openalex-snapshot
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
inferredcites →https://doi.org/10.1007/s00291-021-00633-0openalex-snapshot
The last-mile vehicle routing problem with delivery options
inferredcites →https://doi.org/10.1007/s10288-006-0001-9openalex-snapshot
Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
inferredcites →https://doi.org/10.1007/s10479-021-04375-8openalex-snapshot
Electric vehicles fast charger location-routing problem under ambient temperature
inferredcites →https://doi.org/10.1007/s10479-023-05177-wopenalex-snapshot
A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method
inferredcites →https://doi.org/10.1016/0377-2217(89)90188-4openalex-snapshot
The effect of ignoring routes when locating depots
inferredcites →https://doi.org/10.1016/j.asoc.2020.106477openalex-snapshot
The two-echelon multi-objective location routing problem inspired by realistic waste collection applications: The composable model and a metaheuristic algorithm
inferredcites →https://doi.org/10.1016/j.cie.2023.109066openalex-snapshot
Infectious waste management during a pandemic: A stochastic location-routing problem with chance-constrained time windows
inferredcites →https://doi.org/10.1016/j.cie.2024.110096openalex-snapshot
Addressing the challenges of using autonomous robots for last-mile delivery
inferredcites →https://doi.org/10.1016/j.cie.2024.110343openalex-snapshot
Location-routing optimization problem of country-township-village three-level green logistics network considering fuel-electric mixed fleets under carbon emission regulation
inferredcites →https://doi.org/10.1016/j.cie.2025.110932openalex-snapshot
Location-routing optimization problem of pharmaceutical cold chain logistics with oil-electric mixed fleets under uncertainties
inferredcites →https://doi.org/10.1016/j.cor.2005.09.012openalex-snapshot
A general heuristic for vehicle routing problems
inferredcites →https://doi.org/10.1016/j.cor.2012.04.007openalex-snapshot
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics
inferredcites →https://doi.org/10.1016/j.cor.2012.05.008openalex-snapshot
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
inferredcites →https://doi.org/10.1016/j.cor.2014.06.007openalex-snapshot
A decomposition-based heuristic for the multiple-product inventory-routing problem
inferredcites →https://doi.org/10.1016/j.cor.2014.07.003openalex-snapshot
Battery swap station location-routing problem with capacitated electric vehicles
inferredcites →https://doi.org/10.1016/j.cor.2016.01.006openalex-snapshot
A simple and effective evolutionary algorithm for the capacitated location–routing problem
inferredcites →https://doi.org/10.1016/j.cor.2016.06.014openalex-snapshot
A large neighbourhood based heuristic for two-echelon routing problems
inferredcites →https://doi.org/10.1016/j.cor.2020.104919openalex-snapshot
The two-echelon vehicle routing problem with covering options: City logistics with cargo bikes and parcel lockers
inferredcites →https://doi.org/10.1016/j.cor.2020.105034openalex-snapshot
A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
inferredcites →https://doi.org/10.1016/j.cor.2021.105251openalex-snapshot
The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach
inferredcites →https://doi.org/10.1016/j.cor.2022.106024openalex-snapshot
The Heterogeneous Fleet Vehicle Routing Problem with Draft Limits
inferredcites →https://doi.org/10.1016/j.cor.2023.106404openalex-snapshot
Simultaneous Location and Vehicle Fleet Sizing of Relief Goods Distribution Centers and Vehicle Routing for Post-Disaster Logistics
inferredcites →https://doi.org/10.1016/j.cor.2023.106435openalex-snapshot
The drone-assisted pickup and delivery problem: An adaptive large neighborhood search metaheuristic
inferredcites →https://doi.org/10.1016/j.ejor.2004.09.004openalex-snapshot
A unified heuristic for a large class of Vehicle Routing Problems with Backhauls
inferredcites →https://doi.org/10.1016/j.ejor.2005.06.074openalex-snapshot
Using clustering analysis in a capacitated location-routing problem
inferredcites →https://doi.org/10.1016/j.ejor.2006.04.004openalex-snapshot
Location-routing: Issues, models and methods
inferredcites →https://doi.org/10.1016/j.ejor.2011.07.030openalex-snapshot
Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
inferredcites →https://doi.org/10.1016/j.ejor.2014.01.005openalex-snapshot
A survey of recent research on location-routing problems
inferredcites →https://doi.org/10.1016/j.ejor.2014.08.030openalex-snapshot
A survey of variants and extensions of the location-routing problem
inferredcites →https://doi.org/10.1016/j.ejor.2018.11.062openalex-snapshot
An effective hybrid approach to the two-stage capacitated facility location problem
inferredcites →https://doi.org/10.1016/j.ejor.2020.08.043openalex-snapshot
Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations
inferredcites →https://doi.org/10.1016/j.ejor.2022.02.002openalex-snapshot
Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
inferredcites →https://doi.org/10.1016/j.ejor.2022.03.058openalex-snapshot
A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system
inferredcites →https://doi.org/10.1016/j.ejor.2024.02.034openalex-snapshot
Recourse strategy for the routing problem of mobile parcel lockers with time windows under uncertain demands
inferredcites →https://doi.org/10.1016/j.eswa.2023.120598openalex-snapshot
An exact algorithm for Two-Echelon Location-Routing problem with simultaneous pickup and delivery
inferredcites →https://doi.org/10.1016/j.jclepro.2020.122801openalex-snapshot
Biobjective low-carbon location-routing problem for cold chain logistics: Formulation and heuristic approaches
inferredcites →https://doi.org/10.1016/j.jii.2024.100573openalex-snapshot
Integrated location and routing for cold chain logistics networks with heterogeneous customer demand
inferredcites →https://doi.org/10.1016/j.omega.2011.09.002openalex-snapshot
The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach
inferredcites →https://doi.org/10.1016/j.omega.2017.05.002openalex-snapshot
Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search
inferredcites →https://doi.org/10.1016/j.rser.2023.113630openalex-snapshot
A greener last mile: Analyzing the carbon emission impact of pickup points in last-mile parcel delivery
inferredcites →https://doi.org/10.1016/j.trc.2023.104022openalex-snapshot
Pickup and delivery with lockers
inferredcites →https://doi.org/10.1016/j.trc.2023.104322openalex-snapshot
The drone latency location routing problem under uncertainty
inferredcites →https://doi.org/10.1016/j.tre.2015.10.011openalex-snapshot
A location-routing model for prepositioning and distributing emergency supplies
inferredcites →https://doi.org/10.1016/j.tre.2019.06.015openalex-snapshot
The time-dependent location-routing problem
inferredcites →https://doi.org/10.1016/j.tre.2019.09.001openalex-snapshot
Integrating collection-and-delivery points in the strategic design of urban last-mile e-commerce distribution networks
inferredcites →https://doi.org/10.1016/j.tre.2021.102541openalex-snapshot
Profit-maximizing parcel locker location problem under threshold Luce model
inferredcites →https://doi.org/10.1016/s0377-2217(98)00107-6openalex-snapshot
A two-phase tabu search approach to the location routing problem
inferredcites →https://doi.org/10.1080/00207543.2017.1395490openalex-snapshot
A parcel locker network as a solution to the logistics last mile problem
inferredcites →https://doi.org/10.1080/01605682.2019.1650625openalex-snapshot
A two-echelon location-routing problem with synchronisation
inferredcites →https://doi.org/10.1109/access.2022.3152062openalex-snapshot
A Simulated Annealing Algorithm for the Vehicle Routing Problem With Parcel Lockers
inferredcites →https://doi.org/10.1109/tits.2023.3266807openalex-snapshot
Accelerating Two-Phase Multiobjective Evolutionary Algorithm for Electric Location-Routing Problems
inferredcites →https://doi.org/10.1111/itor.12399openalex-snapshot
Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery
inferredcites →https://doi.org/10.1155/2014/517467openalex-snapshot
A Hybrid GRASP+VND Heuristic for the Two‐Echelon Vehicle Routing Problem Arising in City Logistics
inferredcites →https://doi.org/10.1287/ijoc.2023.1288openalex-snapshot
Decomposition Strategies for Vehicle Routing Heuristics
inferredcites →https://doi.org/10.1287/mnsc.2020.01274openalex-snapshot
Customer Preferences for Delivery Service Attributes in Attended Home Delivery
inferredcites →https://doi.org/10.1287/opre.12.4.568openalex-snapshot
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
inferredcites →https://doi.org/10.1287/trsc.1050.0135openalex-snapshot
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
inferredcites →https://doi.org/10.1287/trsc.2017.0746openalex-snapshot
An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities
inferredcites →https://doi.org/10.1287/trsc.2018.0836openalex-snapshot
Vehicle Routing and Location Routing with Intermediate Stops: A Review
inferredcites →https://doi.org/10.1287/trsc.2023.0287openalex-snapshot
Demand Steering in a Last-Mile Delivery Problem with Home and Pickup Point Delivery Options
inferredcites →https://doi.org/10.3390/ijerph15010086openalex-snapshot
Optimization of Location–Routing Problem for Cold Chain Logistics Considering Carbon Footprint
inferredcites →https://doi.org/10.3390/math10060920openalex-snapshot
The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.