As express courier market expands rapidly, companies are exposed to fierce competition. To cope with struggle for their survival, they are continuously making efforts to improve their service system. Even if most of service centers are directly linked to a consolidation terminal in courier service network, some of them with regional disadvantages are operated in milk run type from/to the consolidation terminal, which is a traditional PDP (Pick-up and Delivery Problem). This study suggests an approach to solve the PDP with the objective of maximizing the incremental profit, which belongs to PTP (Profitable Tour Problem) class. After the PTP is converted to TSP (Traveling Salesman Problem) with the same objective, a heuristic algorithm based ...
We use an interactive genetic algorithm to divide and conquer large traveling salesperson problems. ...
Abstract — This paper presents the literature survey review of Travelling Salesman Problem (TSP). TS...
The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form....
Abstract. As express courier market expands rapidly, companies are exposed to fierce competition. To...
As express courier market expands rapidly, companies are exposed to fierce competition. To cope with...
In this work, we consider the Traveling Salesman Problem with Pickup and Delivery (TSPPD), which is ...
© 2020 IEEE.Nowadays, with the increase of e-commerce sites, the cargo sector has been growing rapid...
Nowadays, courier service has shown a tremendous increase in Malaysia. This courier service turned o...
In delivering packages, goods, and in doing a business, location is a critical variable to control. ...
Transportation and distribution activities require companies to have careful transportation planning...
Nowadays, managerial decisions regarding how to select the company’s strategy between a responsive o...
In Korean express delivery service market, many domestic companies have been competing fiercely to e...
Abstract: Travelling salesman problem with profits is a version of a classic travelling salesman pro...
One problem in collaborative pickup delivery problem (PDP) was excessive outsourced jobs. It happene...
The main goal of the master's thesis was to analyze travelling salesmen problem with additional limi...
We use an interactive genetic algorithm to divide and conquer large traveling salesperson problems. ...
Abstract — This paper presents the literature survey review of Travelling Salesman Problem (TSP). TS...
The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form....
Abstract. As express courier market expands rapidly, companies are exposed to fierce competition. To...
As express courier market expands rapidly, companies are exposed to fierce competition. To cope with...
In this work, we consider the Traveling Salesman Problem with Pickup and Delivery (TSPPD), which is ...
© 2020 IEEE.Nowadays, with the increase of e-commerce sites, the cargo sector has been growing rapid...
Nowadays, courier service has shown a tremendous increase in Malaysia. This courier service turned o...
In delivering packages, goods, and in doing a business, location is a critical variable to control. ...
Transportation and distribution activities require companies to have careful transportation planning...
Nowadays, managerial decisions regarding how to select the company’s strategy between a responsive o...
In Korean express delivery service market, many domestic companies have been competing fiercely to e...
Abstract: Travelling salesman problem with profits is a version of a classic travelling salesman pro...
One problem in collaborative pickup delivery problem (PDP) was excessive outsourced jobs. It happene...
The main goal of the master's thesis was to analyze travelling salesmen problem with additional limi...
We use an interactive genetic algorithm to divide and conquer large traveling salesperson problems. ...
Abstract — This paper presents the literature survey review of Travelling Salesman Problem (TSP). TS...
The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form....