On the public citation graph

A Pre-Warehouse Lrp Optimization Model in Cold Chain Logisticsbased on Cloud Genetic Simulated Annealing Algorithm

https://doi.org/10.2139/ssrn.4647287
0 signed · 29 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/s00170-003-1639-5openalex-extracted
A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration
inferredcites →https://doi.org/10.1007/s10479-017-2509-0openalex-extracted
A survey of the standard location-routing problem
inferredcites →https://doi.org/10.1016/j.cie.2013.11.006openalex-extracted
The impact of food perishability issues in the vehicle routing problem
inferredcites →https://doi.org/10.1016/j.cor.2010.09.019openalex-extracted
A Branch-and-Cut method for the Capacitated Location-Routing Problem
inferredcites →https://doi.org/10.1016/j.ejor.2005.04.034openalex-extracted
Redesigning a warehouse network
inferredcites →https://doi.org/10.1016/j.eswa.2023.120979openalex-extracted
Green vehicle routing using mixed fleets for cold chain distribution
inferredcites →https://doi.org/10.1016/j.ijpe.2007.06.005openalex-extracted
Response to a factual comment on the erratum to “Incorporating transportation cost in the lot size and pricing decisions with downward sloping demand” by Prof. S.K. Goyal
inferredcites →https://doi.org/10.1016/j.jclepro.2020.120842openalex-extracted
An integrated location-routing-inventory model for sustainable design of a perishable products supply chain network
inferredcites →https://doi.org/10.1016/j.jfoodeng.2007.07.008openalex-extracted
A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food
inferredcites →https://doi.org/10.1016/j.trb.2011.02.004openalex-extracted
The Pollution-Routing Problem
inferredcites →https://doi.org/10.1016/j.wasman.2021.08.034openalex-extracted
A bi-level multi-objective location-routing model for municipal waste management with obnoxious effects
inferredcites →https://doi.org/10.1016/s0191-2615(99)00016-8openalex-extracted
Solving the pickup and delivery problem with time windows using reactive tabu search
inferredcites →https://doi.org/10.1016/s0377-2217(98)00107-6openalex-extracted
A two-phase tabu search approach to the location routing problem
inferredcites →https://doi.org/10.1038/scientificamerican0792-66openalex-extracted
Genetic Algorithms
inferredcites →https://doi.org/10.1057/jors.1964.47openalex-extracted
On the Location of Supply Points to Minimize Transport Costs
inferredcites →https://doi.org/10.1080/00288230709510350openalex-extracted
Improved two‐grade delayed particle swarm optimisation (TGDPSO) for inventory facility location for perishable food distribution centres in Beijing
inferredcites →https://doi.org/10.1080/01621459.1949.10483310openalex-extracted
The Monte Carlo Method
inferredcites →https://doi.org/10.1109/icsssm.2006.320765openalex-extracted
A Branch and Cut method for the Capacitated Location-Routing Problem
inferredcites →https://doi.org/10.1111/itor.12091openalex-extracted
A relax‐and‐price heuristic for the inventory‐location‐routing problem
inferredcites →https://doi.org/10.1111/j.1467-9787.1961.tb01276.xopenalex-extracted
THE RELATIONSHIP BETWEEN TRANSPORTATION COSTS AND LOCATION RENT IN TRANSPORTATION PROBLEMS
inferredcites →https://doi.org/10.1287/opre.1110.0989openalex-extracted
An Exact Method for the Capacitated Location-Routing Problem
inferredcites →https://doi.org/10.1287/trsc.1060.0156openalex-extracted
Location-Routing Problems with Distance Constraints
inferredcites →https://doi.org/10.1287/trsc.2018.0836openalex-extracted
Vehicle Routing and Location Routing with Intermediate Stops: A Review
inferredcites →https://doi.org/10.14311/nnw.2019.29.012openalex-extracted
GENETIC ALGORITHM FOR THE CONTINUOUS LOCATION-ROUTING PROBLEM
inferredcites →https://doi.org/10.3233/jifs-169721openalex-extracted
Multi-objective location-routing problem with simultaneous pickup and delivery for urban distribution
inferredcites →https://doi.org/10.3390/ijerph15010086openalex-extracted
Optimization of Location–Routing Problem for Cold Chain Logistics Considering Carbon Footprint
inferredcites →https://doi.org/10.3390/math10122131openalex-extracted
Regional Location Routing Problem for Waste Collection Using Hybrid Genetic Algorithm-Simulated Annealing
inferredcites →https://doi.org/10.3390/sym10050140openalex-extracted
Multiple Criteria Group Decision-Making Considering Symmetry with Regards to the Positive and Negative Ideal Solutions via the Pythagorean Normal Cloud Model for Application to Economic Decisions
inferredcites →https://doi.org/10.5220/0007405300002104openalex-extracted
Maximization of Profit for a Problem of Location and Routing, with Price-sensitive Demands
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.