IF 1.3 4区计算机科学

Infor Pub Date : 2021-09-23 DOI: 10.1080/03155986.2021.1971432

L. Wu, Qiang Guo, Fuchang Li

引用次数: 0

The time-dependent shortest path and vehicle routing problem 时变最短路径与车辆路径问题

IF 1.3 4区计算机科学

Infor Pub Date : 2021-09-11 DOI: 10.1080/03155986.2021.1973785

R. Jaballah, Marjolein Veenstra, Leandro C. Coelho, J. Renaud

{"title":"The time-dependent shortest path and vehicle routing problem","authors":"R. Jaballah, Marjolein Veenstra, Leandro C. Coelho, J. Renaud","doi":"10.1080/03155986.2021.1973785","DOIUrl":"https://doi.org/10.1080/03155986.2021.1973785","url":null,"abstract":"Abstract We introduce the time-dependent shortest path and vehicle routing problem. In this problem, a set of homogeneous vehicles is used to visit a set of customer locations dispersed over a very large network where the travel times are time-dependent and therefore the shortest path between two locations may change over time. The aim of the problem is to simultaneously determine the sequence in which the customer locations are visited and the arcs traveled on the paths between each pair of consecutively visited customers, such that the total travel time is minimized. We are the first to formally define and solve this fully integrated problem, providing tight bounds to it. We then propose a dynamic time-dependent shortest path algorithm embedded within a simulated annealing metaheuristic to efficiently solve the problem. We also propose a variant of the algorithm where some time-dependent shortest paths are precomputed. We test our formulations and algorithms on a set of real-life instances generated from a dataset of the road network in Québec City, Canada. Our results indicate that the resulting models are too large to be solved even for small instances. However, the obtained bounds show that the developed simulated annealing heuristic performs very well. We also demonstrate that neglecting time-dependent information on traffic leads to imprecise estimation of the traveling time. Moreover, the results show the importance of solving the shortest paths and routing problems simultaneously, as using a set of precomputed shortest paths leads to slightly worse solutions. This work adds new research avenues to city logistics and congestion studies.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"133 1","pages":"592 - 622"},"PeriodicalIF":1.3,"publicationDate":"2021-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84074954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Regional logistics centre: Application to Eastern Canada 区域物流中心:在加拿大东部的应用

IF 1.3 4区计算机科学

Infor Pub Date : 2021-08-02 DOI: 10.1080/03155986.2021.1914963

F. Sarrazin, L. Lebel, N. Lehoux

{"title":"Regional logistics centre: Application to Eastern Canada","authors":"F. Sarrazin, L. Lebel, N. Lehoux","doi":"10.1080/03155986.2021.1914963","DOIUrl":"https://doi.org/10.1080/03155986.2021.1914963","url":null,"abstract":"Abstract The recent difficulties of the wood industry in Canada (decline of the pulp and paper sector, decline in available fiber volume, 2008–2009 housing crisis, etc.) and mounting pressures for a more efficient use of natural resources make it all the more relevant to examine how to make better use of the forest resource. In this regard, the creation of sorting and consolidation yards, distinct from forest sites and mills, offers multiple opportunities for value maximization and cost minimization. This article aims to better understand the interaction between a forest logistics center and a complex forest network while exploring several geo-economic factors favoring the use of such a structure. A profit maximization model is proposed and applied for a case study in the Mauricie region of Quebec, Canada. The results showed that a logistics center would increase the profit by $0.90 (Canadian dollars) for each cubic meter of wood available for harvesting, notably through an increase in the volume of wood processed into finished products of up to 83,000 m3 annually (or 4.6%). A dynamic effect of up to 17% was also observed between the operation of a processing yard and the use of load returns.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"34 1","pages":"439 - 464"},"PeriodicalIF":1.3,"publicationDate":"2021-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89078155","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

A new Lagrangian-Benders approach for a concave cost supply chain network design problem 求解凹成本供应链网络设计问题的lagrange - benders方法

IF 1.3 4区计算机科学

Infor Pub Date : 2021-08-02 DOI: 10.1080/03155986.2021.1923978

A. Saif, Ali Keyvandarian, S. Elhedhli

{"title":"A new Lagrangian-Benders approach for a concave cost supply chain network design problem","authors":"A. Saif, Ali Keyvandarian, S. Elhedhli","doi":"10.1080/03155986.2021.1923978","DOIUrl":"https://doi.org/10.1080/03155986.2021.1923978","url":null,"abstract":"Abstract This article presents an extended facility location model for multiproduct supply chain network design, that accounts for concave capacity, transportation, and inventory costs (induced by economies of scale, quantity discounts and risk pooling, respectively). The problem is formulated as a mixed-integer nonlinear program (MINLP) with linear constraints and a large number of separable concave terms in the objective function. We propose a solution approach that combines stabilized Lagrangian relaxation with a novel Benders decomposition. Lagrangian relaxation is used first to decompose the problem by potential warehouse location into low-rank concave minimization subproblems. Benders decomposition is then applied to solve the subproblems by shifting the concave terms to a low-dimensional master problem that is solved effectively through implicit enumeration. Finally, a feasible solution for the original problem is constructed from the partial subproblems solutions by solving a restricted set covering problem. The proposed approach is tested on several instances from the literature and compared against a state-of-the-art solver. Furthermore, a realistic case study is used to demonstrate the impact of concavities in the cost components with extensive sensitivity analyses.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"74 1","pages":"495 - 516"},"PeriodicalIF":1.3,"publicationDate":"2021-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80743450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Behavior-based pricing: an analysis of the impact of anticipated regret 基于行为的定价:对预期后悔影响的分析

IF 1.3 4区计算机科学

Infor Pub Date : 2021-06-30 DOI: 10.1080/03155986.2021.1939841

Qin Zhou, Kum Fai Yuen

引用次数: 2

Pack size effects on retail store inventory and storage space needs 包装大小影响零售商店的库存和存储空间需求

IF 1.3 4区计算机科学

Infor Pub Date : 2021-05-19 DOI: 10.1080/03155986.2021.1918487

Lita Das, Andre L. Carrel, C. Caplice

引用次数: 1

Periodic supply vessel planning under demand and weather uncertainty 在需求和天气不确定的情况下进行定期补给船计划