Green logistics location-routing problem with eco-packages
The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Abstract
Abstract Optimization of the green logistics location-routing problem with eco-packages involves solving a two-echelon location-routing problem and the pickup and delivery problem with time windows. The first echelon consists of large eco-package transport, which is modeled by a time-discretized transport-concentrated network flow programming in the resource sharing state–space–time (SST) network. The second echelon focuses on small eco-package pickups and deliveries, established by the cost-minimized synchronization-oriented location routing model that minimizes the total generalized cost, which includes internal transportation cost, value of eco-packages, short-term benefits and environmental externalities. In addition, the Gaussian mixture clustering algorithm is utilized to assign customers to their respective service providers in the pickup and delivery process, and a Clarke–Wright saving method-based non-dominated sorting genetic algorithm II is designed to optimize pickup and delivery routes, and improve their cost-effectiveness and degree of synchronization. Different strategy testing results are used in the service phase as input data to calculate the cost of the transport phase, which is solved through a Lagrangian relaxation approach. The 3D SST network representation innovatively captures the eco-package route sequence and state transition constraints over the shortest path in the pickup and delivery at any given moment of the transport phase. A large-scale logistics network in Chengdu, China, is used to demonstrate the proposed model and algorithm, and undertake sensitivity analysis considering the life cycle of green eco-packages.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
Clarke, G., & Wright, J. W. (1964) · Operations Research · doi:10.1287/opre.12.4.568 · Cited by 3,894
Bektaş, T., & Laporte, G. (2011) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2011.02.004 · Cited by 1,219
Location-routing: Issues, models and methods
Nagy, G., & Salhi, S. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.04.004 · Cited by 1,132
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Cordeau, J.-F. (2006) · Operations Research · doi:10.1287/opre.1060.0283 · Cited by 695
Modelling accessibility using space-time prism concepts within geographical information systems
MILLER, H. J. (1991) · International journal of geographical information systems · doi:10.1080/02693799108927856 · Cited by 676
Govindan, K., Jafarian, A., Khodaverdi, R., & Devika, K. (2014) · International Journal of Production Economics · doi:10.1016/j.ijpe.2013.12.028 · Cited by 649
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Ropke, S., & Cordeau, J.-F. (2009) · Transportation Science · doi:10.1287/trsc.1090.0272 · Cited by 487
Battery swap station location-routing problem with capacitated electric vehicles
Yang, J., & Sun, H. (2015) · Computers & Operations Research · doi:10.1016/j.cor.2014.07.003 · Cited by 434
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
Røpke, S., Cordeau, J., & Gilbert Laporte, A. (2007) · Networks · doi:10.1002/net.20177 · Cited by 353
Govindan, K., Mina, H., Esmaeili, A., & Gholami-Zanjani, S. M. (2020) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2019.118317 · Cited by 331
Mahmoudi, M., & Zhou, X. (2016) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2016.03.009 · Cited by 316
Self-citationZiliaskopoulos, A. K., & Mahmassani, H. S. (1993) · Transportation Research Record Journal of the Transportation Research Board · Cited by 268
Packaging waste recycling in Europe: is the industry paying for it?
da Cruz, N. F., Ferreira, S., Cabral, M., Simões, P., & Marques, R. C. (2014) · Waste Management · doi:10.1016/j.wasman.2013.10.035 · Cited by 216
Ant colony optimization with clustering for solving the dynamic location routing problem
Gao, S., Wang, Y., Cheng, J., Inazumi, Y., & Tang, Z. (2016) · Applied Mathematics and Computation · doi:10.1016/j.amc.2016.03.035 · Cited by 208
Self-citationRabbani, M., Heidari, R., Farrokhi-Asl, H., & Rahimi, N. (2017) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2017.09.029 · Cited by 196
Compromising system and user interests in shelter location and evacuation planning
Bayram, V., Tansel, B. Ç., & Yaman, H. (2015) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2014.11.010 · Cited by 194
Mahmoudi, M., & Parviziomran, I. (2020) · International Journal of Production Economics · doi:10.1016/j.ijpe.2020.107730 · Cited by 192
Self-citationKara, İ., Laporte, G., & Bektaş, T. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(03)00377-1 · Cited by 180
Profit distribution in collaborative multiple centers vehicle routing problem
Wang, Y., Ma, X., Li, Z., Liu, Y., Xu, M., & Wang, Y. (2017) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2017.01.001 · Cited by 179
Self-citationThe Continuous-Time Service Network Design Problem
Boland, N., Hewitt, M., Marshall, L., & Savelsbergh, M. (2017) · Operations Research · doi:10.1287/opre.2017.1624 · Cited by 176
Bergmann, F. M., Wagner, S. M., & Winkenbach, M. (2019) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2019.09.013 · Cited by 172
Liu, R., Li, S., & Yang, L. (2018) · Omega · doi:10.1016/j.omega.2018.10.020 · Cited by 172
An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities
Schiffer, M., & Walther, G. (2018) · Transportation Science · doi:10.1287/trsc.2017.0746 · Cited by 170
Ocampo, E. M. T., Franco, J. F., Echeverri, M. G., & Guimarães, F. G. (2017) · Computers & Industrial Engineering · doi:10.1016/j.cie.2017.05.013 · Cited by 168
Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach
Bayram, V., & Yaman, H. (2018) · Transportation Science · doi:10.1287/trsc.2017.0762 · Cited by 162
Strategic planning of electric logistics fleet networks: A robust location-routing approach
Schiffer, M., & Walther, G. (2017) · Omega · doi:10.1016/j.omega.2017.09.003 · Cited by 156
Social aspect of sustainable packaging
Nordin, N., & Selke, S. (2010) · Packaging Technology and Science · doi:10.1002/pts.899 · Cited by 147
Two-echelon location-routing optimization with time windows based on customer clustering
Wang, Y., Assogba, K., Liu, Y., Ma, X., Xu, M., & Wang, Y. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.03.018 · Cited by 130
Self-citationEconomic cost recovery in the recycling of packaging waste: the case of Portugal
da Cruz, N. F., Simões, P., & Marques, R. C. (2012) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2012.05.043 · Cited by 127
Cooperation and profit allocation in two-echelon logistics joint distribution network optimization
Wang, Y., Ma, X., Liu, M., Гонг, K., Liu, Y., Xu, M., & Wang, Y. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.02.025 · Cited by 108
Self-citationResource Pooling and Cost Allocation Among Independent Service Providers
Karsten, F., Slikker, M., & van Houtum, G. (2015) · Operations Research · doi:10.1287/opre.2015.1360 · Cited by 79
Tang, J., Song, Y., Miller, H. J., & Zhou, X. S. (2015) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2015.08.014 · Cited by 75
Self-citationWang, Y., Zhang, S., Assogba, K., Fan, J., Xu, M., & Wang, Y. (2018) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2018.06.208 · Cited by 73
Self-citationCompensation and profit distribution for cooperative green pickup and delivery problem
Wang, J., Yu, Y., & Tang, J. (2018) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2018.05.003 · Cited by 59
Tiew, K.-G., Basri, N. E. A., Deng, H. Q., Watanabe, K., Zain, S. M., & Wang, S. (2019) · Journal of Environmental Management · doi:10.1016/j.jenvman.2019.02.033 · Cited by 56
Wang, Z., Leng, L., Wang, S., Li, G., & Zhao, Y. (2020) · Computational Intelligence and Neuroscience · doi:10.1155/2020/8395754 · Cited by 47
The dynamic shortest path problem with time-dependent stochastic disruptions
Sever, D. D., Zhao, L., Dellaert, N., Demir, E., Woensel, T. V., & de Kok, A. G. (2018) · Transportation Research Part C Emerging Technologies · doi:10.1016/j.trc.2018.04.018 · Cited by 42
Liu, W., Wan, Z., Wan, Z., & Gong, B. (2019) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2019.119324 · Cited by 42
Lu, G., Zhou, X. S., Mahmoudi, M., Shi, T., & Peng, Q. (2018) · Computers & Industrial Engineering · doi:10.1016/j.cie.2018.03.015 · Cited by 34
Self-citationA Bi-Objective Reverse Logistics Network Design Under the Emission Trading Scheme
Yuchi, Q., Wang, N., Li, S., Yang, Z., & Jiang, B. (2019) · IEEE Access · doi:10.1109/access.2019.2898213 · Cited by 32
Metadata
- Authors
- Wang, Y., Peng, S., Zhou, X., Mahmoudi, M., & Zhen, L.
- Venue
- Transportation Research Part E: Logistics and Transportation Review
- Publisher
- Elsevier BV
- Published
- 2020-11
- Volume
- 143
- Pages
- 102118
- ISSN
- 1366-5545 (ISSN-L)
- OpenAlex
- W3092652491
- Cited by
- 249
- References
- 42
- FWCI
- 18.22
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.