scholarly journals Heuristics Algorithms for a Heterogeneous Fleets VRP with Excessive Demand for the Vehicle at the Pickup Points, and the Longest Traveling Time Constraint: A Case Study in Prasitsuksa Songkloe, Ubonratchathani Thailand

Logistics ◽  
2018 ◽  
Vol 2 (3) ◽  
pp. 15 ◽  
Author(s):  
Sasitorn Kaewman ◽  
Raknoi Akararungruangkul
Keyword(s):  
Best Practices ◽  
Current Practice ◽  
Lower Cost ◽  
Time Constraint ◽  
Neighborhood Search ◽  
Routing Problem ◽  
De Algorithm ◽  
Excessive Demand ◽  
Special Case

This paper presents a methodology to solve a special case of the vehicle routing problem (VRP) called the heterogeneous fleets VRP with excessive demand of the vehicle at the pickup points, and the longest time constraint (HFVRP-EXDE-LTC). We developed two metaheuristics—a differential evolution (DE) algorithm and an adaptive large neighborhood search (ALNS)—to solve the problem. These two proposed methods have been designed to effectively solve a special case of VRP. From the computational results, we can see that the proposed heuristics outperformed the best practices that are currently in use. The DE yielded a 9.78% lower cost than that of the current practice (757,250 baht per year), while ALNS generated a 10.89% (906,750 baht per year) lower cost than that of current practice. Comparing the proposed heuristics, ALNS achieved a 1.01% lower cost than that of DE, as ALNS had a better mechanism that was designed to escape from the local optimal.

scholarly journals Methodology to Solve the Combination of the Generalized Assignment Problem and the Vehicle Routing Problem: A Case Study in Drug and Medical Instrument Sales and Service

2018 ◽  
Vol 9 (1) ◽  
pp. 3 ◽  
Author(s):  
Malichan Thongkham ◽  
Sasitorn Kaewman
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Search Techniques ◽  
De Algorithm ◽  
Local Searches ◽  
Generalized Assignment ◽  
Linear Probability

This article presents algorithms for solving a special case of the vehicle routing problem (VRP). We define our proposed problem of a special VRP case as a combination of two hard problems: the generalized assignment and the vehicle routing problem. The different evolution (DE) algorithm is used to solve the problem. The recombination process of the original DE is modified by adding two more sets of vectors—best vector and random vector—and using two other sets—target vector and trial vector. The linear probability formula is proposed to potentially use one out of the four sets of vectors. This is called the modified DE (MDE) algorithm. Two local searches are integrated into the MDE algorithm: exchange and insert. These procedures create a DE and MDE that use (1) no local search techniques, (2) two local search techniques, (3) only the exchange procedure, and (4) only the insert procedure. This generates four DE algorithms and four MDE algorithms. The proposed methods are tested with 15 tested instances and one case study. The current procedure is compared with all proposed heuristics. The computational result shows that, in the case study, the best DE algorithm (DE-4) has a 1.6% better solution than that of the current practice, whereas the MDE algorithm is 8.2% better. The MDE algorithm that uses the same local search as the DE algorithms generates a maximum 5.814% better solution than that of the DE algorithms.

scholarly journals Comparisons of VRP Optimization Algorithmic Methods for the Optimal Routing of Multiple Delivery Vehicles with Time Constraint

2021 ◽  
Vol 13 (4) ◽  
Author(s):  
Nuttachat Wisittipanit ◽  
Adirek Baisukhan ◽  
Chanin Srisuwannapa
Keyword(s):  
Hybrid Algorithms ◽  
Time Constraint ◽  
Neighborhood Search ◽  
Post Office ◽  
Routing Problem ◽  
Constraint Set ◽  
Delivery Vehicles ◽  
Business Expense ◽  
Proper Solutions ◽  
Better Than

Transportation costs account for a large portion of business expense in any logistics firm; thus, achieving proper solutions that manage those transportation activities well and reduce such expense should be the number one priority for the business. Essentially, such logistics management involves the routing plans for company vehicles that perform delivery/pick up and also the number of vehicles utilized. This study investigated and compared the optimization performances of routing algorithms using simulated geographic data based in Chiang Rai, Thailand, emulating the post office operation which had 1 post office, 4 delivery vehicles and 2 delivery zones (2 vehicles per zone): 65 customer locations for zone A and 74 for zone B. The major objective of this particular routing problem, called Vehicle Routing Problem (VRP), was that the total delivery distance of those 4 delivery vehicles combined should be minimized; moreover, those vehicles mush finish their delivery operation within a time constraint, set at 2 hours. The optimization algorithms, employed for the routing procedures, were Large Neighborhood Search (LNS), Particle Swarm Optimization (PSO), Differential Evolution (DE) and Ant Colony Optimization (ACO), combined into 3 hybrid algorithms (LNS|PSO, LNS|DE and LNS|ACO). Those hybrid algorithms including pure ones (DE, PSO and ACO) were compared for their optimization performances; and the results showed that LNS|ACO hybrid algorithm was superior than the other two hybrid ones and also far better than pure DE, PSO and ACO algorithms at various parameter variants. Additionally, most algorithms (hybrid and pure ones) finished the delivery routing within the time constraint of 2 hours except only for the pure algorithms at minimum parameter variant.

scholarly journals Solving practical waste collection with time windows in an urban area

2020 ◽  
Vol 9 (1) ◽  
pp. 1 ◽  
Author(s):  
Abdulwahab Almutairi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Neighborhood Search ◽  
Large Neighborhood Search ◽  
Optimal Solutions ◽  
Waste Collection ◽  
Routing Problem ◽  
Iterated Greedy

In logistics, several algorithms can be implemented in order to solve the problems of the vehicle routing with variants in order to find near-optimal solutions. Waste Collection can be considered as an essential logistic activity within any area or city. This kind of paper is aimed to implement Iterated greedy (IG) and Adaptive Large Neighborhood Search (ALNS) to solve waste collection vehicle routing problem with time windows on a real-case study. The idea is to generate an efficient way to collect waste problems in an area located in Riyadh, Saudi Arabia. Moreover, generating a route plays a significant role in terms of serving all customers’ demands who have own different time windows of receiving goods. Also, the performance of the proposed algorithms according to all instances is examined and minimizing the total costs and meeting all constraints that related to capacity, time windows, and others. To evaluate the execution of the presented algorithms, the computational results showed essential improvements, and also ALNS algorithm generates reasonable solutions in terms of total costs and a reasonable amount of time, when compared to other algorithms.  

Nonwovens: Global Trends in World Economy, European Foreign Trade, and Selected Case Studies from Poland and Asian Brics Countries

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Zofia Wysokińska ◽  
Tomasz Czajkowski ◽  
Katarzyna Grabowska
Keyword(s):  
Case Studies ◽  
World Economy ◽  
World Market ◽  
Global Trends ◽  
Textile Materials ◽  
Brics Countries ◽  
Recent Trends ◽  
Almost All ◽  
Special Case

AbstractNonwovens are one of the most versatile textile materials and have become increasingly popular in almost all sectors of the economy due to their low manufacturing costs and unique properties. In the next few years, the world market of nonwovens is predicted to grow by 7%–8% annually (International Nonwovens & Disposables Association [INDA], European Disposables and Nonwovens Association [EDANA], and Markets and Markets). This article aims to analyze the most recent trends in the global export and import of nonwovens, to present two case studies of Polish companies that produce them, and to present one special case study of the market of nonwoven geotextiles in China and India, which are the Asian transition economies among the BRICS countries (Brazil, Russia, India, China, and South Africa).

Polytechnic to Business Project (P2B) a Case of Innovation and Knowledge Transference

2019 ◽  
Vol 6 (1) ◽  
pp. 40-49
Author(s):  
Teresa Paiva
Keyword(s):  
Knowledge Transfer ◽  
Best Practices ◽  
Education Institution ◽  
Theoretical Background ◽  
Transfer Model ◽  
Case Study Method ◽  
Multiple Sources ◽  
The Subject ◽  
Manage Innovation

Background: The theoretical background of this article is on the model developed of knowledge transfer between universities and the industry in order to access the best practices and adapt to the study case in question regarding the model of promoting and manage innovation within the universities that best contribute with solution and projects to the business field. Objective: The development of a knowledge transfer model is the main goal of this article, supported in the best practices known and, also, to reflect in the main measurement definitions to evaluate the High Education Institution performance in this area. Methods: The method for this article development is the case study method because it allows the fully understanding of the dynamics present within a single setting, and the subject examined to comprehend what is being done and what the dynamics mean. The case study does not have a data collection method, as it is a research that may rely on multiple sources of evidence and data which should be converged. Results: Since it’s a case study this article present a fully description of the model proposed and implemented for the knowledge transfer process of the institution. Conclusion: Still in a discussion phase, this article presents as conclusions some questions and difficulties that could be pointed out, as well as some good perspectives of performed activity developed.

Management of Optic Neuritis in Ayurveda - A Special Case Report

2018 ◽  
Vol 3 (5) ◽  
Author(s):  
Dr. Harsha S. ◽  
Dr. Mamatha KV.
Keyword(s):  
Optic Nerve ◽  
Optic Neuritis ◽  
Visual Information ◽  
Vision Loss ◽  
Specific Treatment ◽  
Interesting Case ◽  
Treatment Modalities ◽  
Further Development ◽  
Special Case

The optic nerve carries visual information from your eye to your brain. Optic neuritis is when your optic nerve becomes inflamed. Optic neuritis can flare up suddenly from an infection or nerve disease. The inflammation usually causes temporary vision loss that typically happens in only one eye. Those with Optic neuritis sometimes experience pain. As you recover and the inflammation goes away, your vision will likely return. There are no direct references in our classics regarding optic neuritis but can be contemplated as a condition by name Parimlayi Timira. The specific management as such is not cited but a transcendence approach can be done with adopting the treatment which has the ability to pacify the already occurred pathology and prevent the further development of the disease. One such interesting case study on Optic neuritis is elaborated here where in specific treatment modalities (Shodana, Shamana and Kriyakalpas) played role in pacifying the condition.

Decolonial Information Practices: Repatriating and Stewarding the Popol Vuh Online

2019 ◽  
Vol 48 (3-4) ◽  
pp. 107-119
Author(s):  
Pamela Espinosa de los Monteros
Keyword(s):  
Best Practices ◽  
Indigenous Knowledge ◽  
Digital Library ◽  
Knowledge Society ◽  
Knowledge Work ◽  
Vantage Point ◽  
Cultural Appropriation ◽  
Digital Environment ◽  
Popol Vuh

AbstractThe digitization and online dissemination of the Popol Vuh, a historical indigenous knowledge work, poses distinct ethical, legal, intellectual, and technological concerns for humanities researchers and information practitioners seeking to study and digitally curate works through a decolonized consciousness. Ongoing debates on data sovereignty, the repatriation of cultural artifacts, and cultural appropriation question the ability of researchers and information practitioners to effectively steward indigenous knowledge works in a digital environment. While consensus on best practices for the postcolonial digital library or archive remain to be established, information inequity continues to persist, effacing indigenous knowledge, languages, and content from the knowledge society. The following case study will discuss the results of a 10-year multi-institutional initiative to curate, repatriate, and steward the reproduction of an indigenous knowledge work online. From the vantage point of the library, the case study will explore the project’s successes, failures, and the work left to be done.

Sign in / Sign up

Export Citation Format

Share Document