Optimum Restoration of the Shared Pallets Distribution Among Factories and Warehouses

Matsuura, Takafumi; Wada, Satomi; Numata, Kazumiti

doi:10.1007/978-3-642-23860-4_94

Cited by 1 publication

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results of numerical experiments show that both methods outperform our previous methods reported in [4,5]. We conclude that the proposed search strategies work well to a certain extent.…”

Section: Resultssupporting

confidence: 56%

“…5, although optimal solutions are found using the Gurobi solver for small-sized instances (n = 30, 40), in the case of large-size instances (n = 50), the optimal solution cannot be obtained owing to memory shortage. The performances of Methods 1 and 2 are better than that of our previously proposed method [4,5] for all instances. Method 2 can yield the optimal solution for small-size instances (Fig.…”

Section: Numerical Experimentsmentioning

confidence: 75%

“…To solve the BSSRP, we have already proposed heuristic methods [4,5]. The methods are based on the simplest constructive and improved methods for the TSP: the nearest neighbor method, the 2-opt algorithm, and the insertion algorithm (Fig.…”

Section: Proposed Heuristic Methodsmentioning

confidence: 99%

“…Independently of the 1-PDTSP, we presented the optimization model of the BSS, called the bike sharing system routing problem (BSSRP), and proposed basic heuristic methods to solve it [4,5].…”

Section: Introductionmentioning

confidence: 99%

“…In this study, we develop new solution methods that generate more precise solutions than those in [4,5]. In the followings, we define the BSSRP as an integer programming problem, and investigate some feasibility conditions of the problem.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Heuristic Methods for the Bike-Sharing System Routing Problem

Wada

Matsuura

Numata

2013

Journal of Signal Processing

Self Cite

View full text Add to dashboard Cite

In recent years, a bike-sharing system (BSS) has been introduced as a means of inner city transportation in cities of various countries. The BSS consists of one control center and many dispersed stations where rental bicycles are parked. After many people use the bicycles, the distribution of bicycles among stations changes from the managed initial distribution to a disarranged one. Hence, it is necessary to restore the disarranged distribution to the initial one at the certain time intervals to sustain the good performance of the BSS. This work is done by vehicles that transport bicycles from stations with excess bicycles to ones with a shortage. How to accomplish this task as efficiently as possible is an interesting issue. We have presented a mathematical optimization model on this issue named the BSS routing problem (BSSRP) to determine the shortest tour of the transport vehicle, and proposed heuristic solution methods to solve it. In this paper, we propose two new solution methods for the BSSRP. One is based on the idea of searching for solutions including the infeasible space, and the other is based on the idea of dividing the search process into two phases. The results of numerical experiments show that both newly proposed methods are superior to previous methods.

show abstract

Section: Resultssupporting

confidence: 56%

Section: Numerical Experimentsmentioning

confidence: 75%

Section: Proposed Heuristic Methodsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations