On green routing and scheduling problem

The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools

Hybrid approaches for mobile robot navigation

The work described in this thesis contributes to the efficient solution of mobile robot navigation problems. A series of new evolutionary approaches is presented. Two novel evolutionary planners have been developed that reduce the computational overhead in generating plans of mobile robot movements. In comparison with the best-performing evolutionary scheme reported in the literature, the first of the planners significantly reduces the plan calculation time in static environments. The second planner was able to generate avoidance strategies in response to unexpected events arising from the presence of moving obstacles. To overcome limitations in responsiveness and the unrealistic assumptions regarding a priori knowledge that are inherent in planner-based and a vigation systems, subsequent work concentrated on hybrid approaches. These included a reactive component to identify rapidly and autonomously environmental features that were represented by a small number of critical waypoints. Not only is memory usage dramatically reduced by such a simplified representation, but also the calculation time to determine new plans is significantly reduced. Further significant enhancements of this work were firstly, dynamic avoidance to limit the likelihood of potential collisions with moving obstacles and secondly, exploration to identify statistically the dynamic characteristics of the environment. Finally, by retaining more extensive environmental knowledge gained during previous navigation activities, the capability of the hybrid navigation system was enhanced to allow planning to be performed for any start point and goal point

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

University Optical Fibre Network Access Optimisation: A Case Study

For network access, it is always desired that a fibre optic network connectivity be the major area of cost minimization, while keeping quality of service as high as possible. This is because overall cost of setting up a fibre optic cable route is usually very high in relation to other components of the network. In this study, three buildings clusters were mapped to the University Network Operating Center, and the network was developed as a fail-safe network, so that in the case of damage to a cable or connecting component, users are not cut out. The problem was formulated as a Mathematical Programming problem and solved the resulting transportation problem using MATLAB linear programming solution. Results from the mathematical model shows an optimized cost for which a fibre Optic network connectivity can be further develope

A multi-objective evolutionary optimisation model for heterogeneous vehicles routing and relief items scheduling in humanitarian crises

In a disaster scenario, relief items distribution is required as early as possible for the disaster victims to reduce the associated risks. For the distribution tasks, an effective and efficient relief items distribution model to generated relief items distribution schedules is essential to minimise the impact of disaster to the disaster victims. However, developing efficient distribution schedules is challenging as the relief items distribution problem has multiple objectives to look after where the objectives are mostly contradictorily creating a barrier to simultaneous optimisation of each objective. Also, the relief items distribution model has added complexity with the consideration of multiple supply points having heterogeneous and limited vehicles with varying capacity, cost and time. In this paper, multi-objective evolutionary optimisation with the greedy heuristic search has been applied for the generation of relief items distribution schedules under heterogeneous vehicles condition at supply points. The evolutionary algorithm generates the disaster region distribution sequence by applying a global greedy heuristic search along with a local search that finds the efficient assignment of heterogeneous vehicles for the distribution. This multi-objective evolutionary approach provides Pareto optimal solutions that decision-makers can apply to generate effective distribution schedules that optimise the distribution time and vehicles’ operational cost. In addition, this optimisation also incorporated the minimisation of unmet relief items demand at the disaster regions. The optimised distribution schedules with the proposed approach are compared with the single-objective optimisation, weighted single-objective optimisation and greedy multi-objective optimisation approaches. The comparative results showed that the proposed multi-objective evolutionary approach is an efficient alternative for finding the distribution schedules with optimisation of distribution time and operational cost for the relief items distribution with heterogeneous vehicles

On optimal mission planning for conventional and electric heavy duty vehicles

Ever-growing energy consumption and CO2 emissions due to the increase in road transport are major challenges that attract international attention, especially policy makers, logistic service providers and customers considering environmental, ecological and economic issues. Other negative side-effects caused by the growth of the road transport are the extensive economic and social costs because of traffic congestion. Thus, there is a strong motivation to investigate possible ways of improving transport efficiency aiming at achieving a sustainable transport, e.g. by finding the best compromise between resource consumption and logistics performance. The transport efficiency can be improved by optimal planning of the transport mission, which can be interpreted as optimising mission start and/or finish time, and velocity profile of the driving vehicle. This thesis proposes a bi-layer mission planner for long look-ahead horizons stretched up to hundreds of kilometers. The mission planner consists of logistics planner as its top level and eco-driving supervisor as its bottom level. The logistics planner aims at optimising the mission start and/or finish time by optimising energy consumption and travel time, subject to road and traffic information, e.g. legal and dynamic speed limits. The eco-driving supervisor computes the velocity profile of the driving vehicle by optimising the energy consumption and penalising driver discomfort. To do so, an online-capable algorithm has been formulated in MPC framework, subject to road and traffic information, and the pre-optimised mission start and/or finish time. This algorithm is computationally efficient and enables the driving vehicle to adapt and optimally respond to predicted disturbances within a short amount of time. The mission planner has been applied to conventional and fully-electric powertrains. It is observed that total travel timeis reduced up to 5.5 % by optimising the mission start time, when keeping anaverage cruising speed of about 75 km/h. Also, compared to standard cruise control, the energy savings of using this algorithm is up to 11.6 %