EXTENSION OF THE MINIMUM COST FLOW PROBLEM (MCFP OR CNF) BY CONSIDERATION OF TIME AND QUANTITY OF LOADS WITH MAXIMUM TIME

This paper extends the general problem of minimizing the total cost of transport on the road network (CNF) by considering the total time, maximum time and total amount of cargo with the longest time. In the literature available to us, models with timing and amount of cargo in the case of a standard transport task were exposed. Optimization is possible by combining 5 criteria, 2 linear and 3 nonlinear ones over the same set of linear constraints. Multicriteria optimization determines Pareto-optimal solutions. Interactive analyst-software algorithms for solving the selected models were defined. The solution of hypothetical problems was illustrated. Closed model with 5 two-way asymmetric communications using software for CNF and it is possible to use software for LP. Four one-criteria problems were solved: total costs, overall transport performance from a time standpoint, transport time (problem of the second type by time) total transport time (problem of the third type by time) and one bi-criteria problem related to the simultaneous minimization of the maximum duration of transport and total costs.

Download Full-text

Eyes on the Road

Mechanical Engineering ◽

10.1115/1.2017-dec-3 ◽

2017 ◽

Vol 139 (12) ◽

pp. 33-33

Author(s):

Michael Abrams ◽

Thomas Romer

Keyword(s):

Major Advance ◽

Cruise Control ◽

Time Data ◽

High Definition ◽

The Road ◽

Software Algorithms ◽

Mapping System ◽

Hebrew University ◽

On The Road ◽

And Training

This article presents an overview of the EyeQ silicon chip developed by Jerusalem-based company Mobileye. The company has been designing hardware and training software algorithms to help vehicles detect and avoid other vehicles. In a major advance, the company has been able to shrink its Advanced Driving Assist System to fit on a single silicon chip it calls EyeQ. When wired to a camera, the system offers superior cruise control, keeps its vehicle in lane, recognizes traffic signs, and can automatically brake for pedestrians and other dangerously close vehicles. The company, which was founded by Amnon Shashua, a professor of computer science at the Hebrew University of Jerusalem, has already sold 20 million of its chips. The advantage of having so many of them already traveling the world’s highways extends beyond the immediate safety they provide. Mobileye is mining the data those chips collect to create a high-definition mapping system that will work with real-time data to help vehicles navigate and eventually become fully autonomous.

Download Full-text

Shortest Path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm

Journal of Computing Research and Innovation ◽

10.24191/jcrinn.v5i4.169 ◽

2020 ◽

Vol 5 (4) ◽

pp. 59-65

Author(s):

Nur Syuhada Muhammat Pazil ◽

Norwaziah Mahmud Mahmud ◽

Siti Hafawati Jamaluddin Jamaluddin

Keyword(s):

Shortest Path ◽

Minimum Cost ◽

Dijkstra Algorithm ◽

Kuala Lumpur ◽

Times Square ◽

The Road ◽

C Programming ◽

Travelling Time ◽

On The Road ◽

The Cost

The shortest path is an issue that involves the route from one point (nodes) to another. It is to find a path with a minimum travelling time. Nowadays, traffic problems have affected many transport users especially in Kuala Lumpur area. The time wasted on the road causes a lot of problems to the users. Furthermore, the costs between two destinations are rather expensive. Therefore, the inability of users to use the shortest path has attracted the researcher to propose several travel alternatives to overcome this problem. In addition, this study will help to improve the efficiency of the road and make people want to use it more often. The objectives of this study are to find the shortest path from Bandar Tun Razak to Berjaya Times Square and to cut down the cost between these two destinations. The time of the shortest path problem and the cost problem are drawn separately. Moreover, Dijkstra algorithm is applied to find the shortest path. The shortest path is calculated by using C programming of Dev C++. Nevertheless, both time and cost of shortest path are constructed in different paths. The time and cost of the journey are described by driving a car from Bandar Tun Razak to Lebuhraya SMART to Kampung Pandan, then Berjaya Times Square. The total time taken is 23 minutes (RM8.00), whereas, the cost is based on the shortest path from Bandar Tun Razak to Taman Maluri to Seasons Tower and Berjaya Times Square. The minimum cost is RM4.00 (30 minutes).

Download Full-text

Autonomous Mobile Robot Platform for On-the-Road Navigation

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.845.750 ◽

2013 ◽

Vol 845 ◽

pp. 750-754 ◽

Cited By ~ 1

Author(s):

Mohammad Abdo Hashem Ali ◽

Musa Mailah ◽

Howe Hing Tang ◽

Mohd Akmal A. Rahim

Keyword(s):

Mobile Robot ◽

Laser Range Finder ◽

Autonomous Mobile Robot ◽

Mechanical Parts ◽

The Road ◽

Software Algorithms ◽

Processing Program ◽

Embedded Controller ◽

On The Road ◽

Robot Platform

This paper presents a mechatronic development of a new mobile robot platform for autonomous on-the-road navigation. It uses sensor fusion involving the camera, laser range finder (LRF) and odometry to guide and find the free collision path during navigation. The embedded controller system has been deliberately developed to integrate the mechanical parts with the electronics and software algorithms. Microsoft Visual C# and MATLAB are linked together to perform the road recognition calculation via the proposed algorithms. The main processing program in C# is later extended to MATLAB environment for image, signal processing and calculation based on data from the LRF and camera. The linking between C# and MATLAB is done using COM automation server and the data in the client C# program passes it to MATLAB and vice versa.

Download Full-text