An ACO-Inspired, Probabilistic, Greedy Approach to the Drone Traveling Salesman Problem

In recent years, major companies have done research on using drones for parcel delivery. Research has shown that this can result in significant savings, which has led to the formulation of various truck and drone routing and scheduling optimization problems. This paper explains and analyzes a new approach to the Drone Traveling Salesman Problem (DTSP) based on ant colony optimization (ACO). The ACO-based approach has an acceptance policy that maximizes the usage of the drone. The results reveal that the pheromone causes the algorithm to converge quickly to the best solution. The algorithm performs comparably to the MIP model, CP model, and EA of Rich & Ham (2018), especially in instances with a larger number of stops

Transfer Routing of Ore Yard by Decentralized Agent Method

In steel works, iron ores are stored in ore yard and sent to various plants of down stream accoding to transfer requests. To attain stable operation, it is neccesary to keep a certain allowable stock level in ore tanks of all plants. To this purpose, ore transfer routing method has been developed based on decentralized agent method. In case of disaster such as a big earthquake or a big fire, damages in the facilities of industrial complex may be unavoidable. In this paper, decentralized optimization method is tested to cope with such emergencies. Decentralized agents corresponding to kind of ore make their own transfer route plan exchanging information with others. As the application of the proposed method, transfer scheduling in ore yard in steel works are made in case of destruction of transfer facilities

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing