Conference PaperPDF Available

Wireless Mobile-Based Shopping Mall Car Parking System (WMCPS)


Abstract and Figures

The existing car parking system in Malaysia usually required the car drivers to search an empty parking space in the car park without providing detail direction toward the available parking space. As the result, drivers may waste a lot of time and unnecessary energy while they turn around in the car park without direction and may cause car traffic congestion in parking space. This paper investigates the problems of car parking system in Malaysia and finally proposed a Wireless Mobile-based Car Parking System using low cost SMS service. The implementation of SMS service into the car parking system enable drivers to receive information regarding the availability of car parking spaces. In this system, the drivers can resend SMS to request for new assignment of car parking spaces if they fail to get the previous assigned destination. This paper demonstrates the design and implementation of Wireless Mobile-based Car Parking System (WMCPS) using SMS services by Breadth First Search (BFS) algorithm in finding the nearest parking space for drivers. The stimulation results reveal the intelligence of this system can efficiently allocate and utilize the car parking spaces inside the car park.
Content may be subject to copyright.
Wireless Mobile-based Shopping Mall
Car Parking System (WMCPS)
Soh Chun Khang Teoh Jie Hong Tan Saw Chin Shengqiong Wang
Multimedia University Multimedia University Multimedia University Faculty of Information and
Jalan Multimedia 63100 Jalan Multimedia 63100 Jalan Multimedia 63100 Communication Technology
Cyberjaya Selangor Cyberjaya Selangor Cyberjaya Selangor Swinburne University of Technology
Malaysia Malaysia Malaysia Melbourne, Australia
Abstract- The existing car parking system in Malaysia usually
required the car drivers to search an empty parking space in the
car park without providing detail direction toward the available
parking space. As the result, drivers may waste a lot of time and
unnecessary energy while they turn around in the car park
without direction and may cause car traffic congestion in parking
space. This paper investigates the problems of car parking system
in Malaysia and finally proposed a Wireless Mobile-based Car
Parking System using low cost SMS service. The implementation
of SMS service into the car parking system enable drivers to
receive information regarding the availability of car parking
spaces. In this system, the drivers can resend SMS to request for
new assignment of car parking spaces if they fail to get the
previous assigned destination. This paper demonstrates the design
and implementation of Wireless Mobile-based Car Parking
System (WMCPS) using SMS services by Breadth First Search
(BFS) algorithm in finding t he nearest parking space for drivers.
The stimulation results reveal the intelligence of this system can
efficiently allocate and utilize the car parking spaces inside the
car park.
It is very common to have huge crowds in shopping malls
during peak hour (lunch time, dinner time, weekend) and
sales periods. Discounts offered by merchants in shopping
mall can attract a lot of customers to come. Most of the
customer travels to the shopping mall with their own
vehicles and this indirectly cause the problem of finding
empty car parking space for the car drivers. Parking space is
necessary for those who love to go for shopping and it is a
must for shopping complex to provide a comfortable, secure
and quality parking space for their customers. Nowadays,
parking space need to be constructed in multi-level since the
number of vehicles is increasing rapidly [1] [2]. As a
consequence, drivers may face difficulties when they are
required to seek in the lengthy multi-level parking space. It is
very troublesome for a driver to seek an unknown available
empty car parking space in a large car park.
Nowadays, there are several car park guidance systems using
different technologies to resolve the parking problem in car
park. In Vehicle Navigation and Information System
Conference 1995, Akihito used the vehicle sensors at each
parking lot to track the exact locations of the empty parking
spaces [3]. Wolff et al used magnetic field sensor and wired-
based concept to test on their simulation car park model [4].
In the year of 2008, Sunway Pyramid and The Mines
shopping complexes also installed with this vehicle sensor
and indicators above each parking space [5] [6]. It will show
green light when no occupied and red light when occupied to
assist the driver to find parking space. This technology can
provide comprehensive knowledge of the car park occupancy
is thus available and assist driver in searching empty car
parking space. Thus, it dramatically decrease the searching
time need to find an empty car parking space. One
shortcoming of vehicle sensor system is driver may not have
luck to park their car near to the entrance. They may lead by
the indicator to park their car far away and this does not
benefit the driver anymore. Another possible situation is
when there is only one available space; there will be more
than one car drive toward it. Competing on an available car
parking space is a waste of time and petrol. Furthermore, a
lot of sensors have to be used inside a car park. This will be
costly for a huge parking area and it also added up to the
sensor maintenance cost.
Some parking systems of foreign countries are providing
online reservation service to customer which they can
reserve a car parking space for a period of time like Munich
Airport [7]. Anyhow, problem arise when they park over the
limit of reserved time, their reserved parking space has been
parked by others and etc. Some of the system provided the
service that assigned parking space for driver via number
printed on ticket, but the parking space may be far away
from driver [8]. Sometimes it is inconvenient as the parking
space may be taken over by those who are illegal parking or
looking for available parking space too. One of the major
problems faced in online reservation systems is wasting
resources.Some drivers may reserve the parking spaces but
didn’t come to park or miss the parking period. So, the
system will hold the reserved parking spaces until the drivers
come or didn’t come. This will waste the parking spaces
because the system cannot utilize the available parking
spaces all the time in the car park. Besides, most drivers do
not have the necessary computer knowledge to make
reservation via the web. Therefore the system is aiming at
computer literate younger generation [9] [10].
With the advancement of wireless technologies, wireless
mobile-based methods have been employed in car parking
system. Monash University’s Facilities & Services Division,
Clayton campushas planned to develop a SMS based car
parking system called Monash Car Park SMS Project (M-
CarPS) [11] [12]. This system provides users with
information about the vacant car park areas and payment for
the parking tickets. However, the drawback of the system is
2010 IEEE Asia-Pacific Services Computing Conference
978-0-7695-4305-5/10 $25.00 © 2010 IEEE
DOI 10.1109/APSCC.2010.116
it only allows user to check the availability of car parking
spaces but does not provide any exact information about car
parking spaces location such as parking lot ID. Consequently,
this system didn’t implement by the Monash University yet
because they didn’t recommend this system to pay or
purchase their ticket fee.
In our proposed mobile-based car parking system, the driver
will be able to receive information about the available
parking spaces inside the car park by using SMS service of
their mobile phone. This proposed car parking system is
designed to benefit the public and to increase the utilization
of parking spaces in shopping complexes’ car park. This
system has been named as Wireless Mobile-based Car
Parking System (hereafter called as “WMCPS”). The
assignment of the vacant parking space is based on the
shortest path distance [13-16] by using BFS algorithm,
taking into consideration the entrance to the car park used
and the nearest entrance into the car park to make the drivers
feel convenient. The benefit of using SMS is because it is
low cost [17 – 20] and if their first assigned parking space is
parked by others, they still can SMS again to get a new
assigned parking space within a minute from the system [21]
[22]. Hence, this feature can act as an emergency assistance
and it can make sure the entire drivers in shopping mall car
park have a place to park their car instead of driving around
in car park for looking parking.
The rest of the paper is organized as follows. Section 2
describes the design and implementation of the WMCPS. In
Section 3, performance evaluation is conducted for the
proposed system. Finally, Section 4 concludes this paper and
suggests some future work.
Fig. 1 below shows the overview operation of the wireless
mobile-based car parking system (WMCPS). First, the driver
arrives at entrance and takes the parking ticket. Then, the
driver may follow the assigned parking spaces (with parking
lot ID) that printed on the ticket to park their vehicle. If there
is available, means there is an empty parking space, driver
may park their vehicle and proceed to the shopping mall.
However, if the driver arrive at the assigned parking space
and found out the parking space is already occupied, driver
may send a SMS to WMCPS to get a new assigned parking
spaces. Within a short period of time, driver may receive a
SMS with a new parking lot ID. Then, driver may proceed to
the new parking space to park their vehicle.
Figure 1: Overview of WMCPS
The SMS service part of WMCPS is developing based on
GSM modem, SMS gateway and web server. OZEKI NG
SMS Gateway (OZEKI) is the software tool that the system
uses to support the services of send and receive SMS.
OZEKI allow user to attach a mobile phone as GSM modem
to the PC, and then control the GSM modem with AT
command to send/receive SMS. [25]
The interface of the system is designed using PHP script on
the Apache web server. Apache send the HTTP requests and
communicate directly with OZEKI. After OZEKI get the
request, it will proceed with GSM modem. The main code
that associated with OZEKI in PHP format to send and
receive SMS is shown as follow:
Send SMS
if ($sender!='') {
# Save incoming messages
$fp = fopen("receivelog.txt","a");
fputs($fp,"Sender: $sender\nReceived Time: $time\nText: $messagedf\n\n");
$responsetext = "Date: $date \nTime: $time2 \nYour assign parking lot ID
is " . $grid[$y][$x] ->label() . ".";
} else {
echo "The PHP script is ready for accepting messages" ;
Receive SMS
$sender = $_GET['sen der'];
$messagedf = $_GET['msgdata'];
$time = $ _GET['recvtime'];
Firstly, Ozeki will set the information for log in to the SMS
gateway; there are user name, password and Ozeki API’s
URL. Next, the “httpRequest($url)” function is to identify
the URL ($url) send by function ozekiSend() is match the
pattern as designed in Ozeki server. The main purpose to
have ozekiSend() function is to generate a complete URL
which contain the information to send, and then send then
URL with call httpRequest function. Lastly, Ozeki retrieve
the hand phone number and message by $_POST function
and then send the information to ozekiSend function.
For the receiving part, Ozeki is use $_GET function to get
sender’s phone number ($sender) and text message
($message) from HTTP platform. If the sender variable
contains sender’s phone number, the function will open a
“txt” file ($fp) to store the text message as a record and reply
a text message ($responsetext) to the sender as a response.
In order to achieve drivers’ satisfaction, the WMCPS
assigns the best car parking lot to the driver. This is done
assuming drivers will prefer to park quickly and nearest to
the entrance they took. Thus, allocation of vacant parking
space is important. In this section, we present the car parking
space assignment algorithm by always assign the car to the
shortest path. The objective of the Breadth First Search (BFS)
algorithm is to utilize the car parking spaces and also provide
the best solution for driver by finding the minimum path’s
distance from the entrance they took. [23][24]
Fig. 2 and Fig. 3 show the layout of the stimulation model
used for WMCPS. There are two floors in the car park
stimulation model with each contains over 110 parking
spaces for each floor. Two entrances (Entrance A and
Entrance B) and two exits (Exit A and Exit B) are located in
the first floor. Cars can go to the upper floor via the ramp
(labeled as To Upstair in the diagram below) and exit from
upper floor via another ramp (labeled as From Upstair in the
diagram below) located opposite.
Figure 2: Stimulation Model (First Floor)
Figure 3: Stimulation Model (Second Level)
“Check Record” is a web service that created to periodically
records the SMS history into the database and allow user of
application to trace back the record when they need it. The
log file contain driver’s mobile number and time they send
the message. The print screen of the web application is show
in Fig. 4. From the figure, the front part (e.g. +6017xxxxxxx)
is mobile phone number of driver that send SMS to the
system to request parking space assignment; the following
part is the time the system received those SMS.
Figure 4: Check record
Fig. 5 below shows an example of the stimulation model.
From the diagram, there are several available parking spaces
in first floor such as A73, A92, B43, B81 (those labels with
green color are available, red are occupied), so the system no
needs to search available parking at second floor. Then,
system will find the shortest path from those available
parking spaces and return the parking lot ID to user. A
function panel is designed to show the detail information of
stimulation result.
Figure 5: Shortest Path Route from stimulation
The diagram show in the Fig.7 reveals the graph of Estimate
Average Period of Time in System (APTS) versus Elapsed
Time. “APTS” is the duration that the driver starting driving
from the entrance to the assigned parking lot successfully.
The “Elapsed Time” in the diagram is the duration (time) for
running the stimulation. The value of “APTS” is taken from
the average of 10 sets’ stimulations data whereas the values
of “Elapsed Time” are fixed as 10 minute, 30 minute,
60minute and 120minute in the simulation. There are 3 types
of arrival rate to be tested in the simulation as the following
Arrival Rate Mean time estimation for new arrival
Fast 7.5 seconds
Medium 15 seconds
Slow 25 seconds
Figure 6: Category of Arrival Rate
From the table show in Fig.6, the inter arrival rate for the
stimulation model can be categorized into 3 types (Fast,
Medium, Slow). For the category of fast arrival rate, the
average inter arrival time for a new car to enter the car park
is 7.5 seconds whereas the category of medium arrival rate is
15 seconds and finally the slow arrival rate category is
recorded as 25 seconds.
Figure 7: APTS vs. Elapsed Time
Referring to the graph in Figure 7, the lowest estimate
average period of time in system (APTS) was achieved after
10 minutes of running the system. The APTS obtained by
slow arrival rate was 13.63 sec, followed by medium arrival
rate with 14.21 sec and fast arrival rate with 17.84 sec. The
APTS achieved by fast arrival rate was much far away from
slow and medium arrival rate. This is due to the number of
cars that assigned to the car park in the system for fast arrival
rate was nearly double compared with slow and medium
arrival rate. The range of the cars that assigned by the fast
arrival rate was 84-93 cars, but there were only 23-25 cars
and 37-40 cars for slow and medium arrival rate respectively.
The availability of empty car parking spaces in first floor is
still high for slow and medium rate. Therefore, driver can
reach the parking spaces in a timely matter and leaving the
system in short period of time.
In the case of the elapsed time is 30 minutes, the APTS
obtained by slow arrival rate was 17.29 sec, followed by
medium arrival rate, 19.74 sec and fast arrival rate, 21.65 sec.
APTS for each category of arrival rate has recorded higher
values compared with the result achieved during 10 minutes
of running the system. This is due to the drivers had to park
their car farther, as the nearest parking spaces have been
The APTS results obtained for each of the arrival rate after
60 minutes of running the system were close to each other.
The APTS recorded at 60 minutes by slow arrival rate was
20.87 sec, medium arrival rate was 21.43 sec, and fast arrival
rate was 21.98 sec. Each of the arrival rates has reached the
same point after 120 minutes of running the system. This
point can be treated as the saturation point as the differences
for all rates were small and the effects of arrival rate can be
ignored. The saturation point happens when the car parking
spaces were almost fully occupied and drivers have to reach
the parking spaces in the remote location of the car park.
From the result, it can be concluded that the more cars enter
the car park and had been assigned to the specific parking lot,
the farther the assigned parking lot that a driver will get as
the nearest parking slot have been occupied by the other cars
that entered earlier. Additionally, the operation of WMCPS
is stable and efficient as the negative impact to the
performance of WMCPS in the case for high arrival rate is
small and is ignorable.
Wireless Mobile-based Car parking System (WMCPS) has
been developed using PHP and SMS service approach. This
particular system will search for an available parking space
using shortest path algorithm (BFS algorithm) and print the
specific parking lot ID on the ticket that the driver taken
before they enter the car park. Besides, the system allows the
driver to request for a new assigned parking lot via SMS if
the previous assigned parking lot is occupied. The system
has been tested on a stimulation model with different
conditions such as slow arrival rate, medium arrival rate and
fast arrival rate. By simulation results, it shows that WMCPS
can allocate the best available parking space to the driver in
term of providing the shortest path distance. Furthermore, the
result also shows that the performance of the system is less
affected by the arrival rate of car that enters the car park. It is
because when the car park is nearly full, drivers have to
reach for parking spaces in the remote location of the car
park. Feature of the SMS service is able to resolve the
problem of failure parking that happened in car park. The
WMCPS will be extended by considering the integration of
GPS technology to provide guidance to the drivers to achieve
a more reliability system in future.
[1] ONE Utama Shopping Centre. [Online].
Available: http://www.1ut
[2] An Archipelago of Treasures
[3] S. Akihito, S. Takumi, M. Kozi and O. Takeshi,
“Parking guidance andinformation systems,” Vehicle Navigation and
Information System Conf erence, 1995, pp478-485.
[4] J. Wolff, T. Heuer, H. Gao, M. Weinmann, S. Voit and U. Hartmann,
“Parking monitor system based on magnetic field sensors,” in Proc.
IEEE Conf. Intelligent Transportation Systems, Toronto, 20 06, pp.
[5] Sunway Pyramid Car Park
[6] The Mines Shopping Mall Car Park
[7] Munich Airport. (No date). Online parking reservations [Online].
[8] P. Sellappan, J. P. Teh, J. M. Lok, K. H. Yew, Y. H. Seo w, S. E. Khor,
and W. M. Kuan. Intelligen Intelligent Indoor Parking Management System
[Online IT Journal]. Available:
[9]Majority of SA Internet users are teenagers: za/about_press%20teens.html
[10], “Using the internet t o market to a
younger generation, pro s and cons”. [Online]. Available:
_market_to_a_younger_generation_pros_and_cons_025451. html
[11]Monash Univer sity. (No date). Fees for 2009 Car Parking Permits
[Online]. Available: http ://
[12]Monash Univer sity. (No date). Carpark SMS [Online]. Available: projects/carpark
[13] Amit Patel, “Amit’s Game Programming Information”.[Online].
[14] B. V. Cherkassky, A. V. Goldberg, and T. Radzik, “Shortest Paths
Algorithms Theory and Experimental Evaluation,” in Proceedings of the 5th
Annual ACM SIAM Symposium on Discrete Algorithms, Arlington, VA, pp.
516-525, January 1994.
[15] D. B. Johnson, “A note on Dijkstra’s shortest path algorithm,” J.ACM,
vol. 20, no. 3, pp. 385-388, July 1973.
[16] L. Fu, D. Sun, and L. R. Rilett, “Heuristic shortest path algorithms for
transportation applications: state of the art,” Computers in Operations
Research, Vol. 33, No. 11, pp. 3324–3343, November
[17] Maxis. [Online]. Available:
[18] Celcom. [Online].
[19] Digi. [Online]. Available:
[20] U Mobile. [Online]. Available:
[21] Informatel, Ready To SMS web service
[22] Google App Engi ne application. [Online]. Available: com/appengine/kb/sms.html#time
[23] BFS Shortest path; page 3
[24] Breadth-First Searc h
... In the research community, an approaching car parking system has been proposed as a solution rather than a system alone. The integration of collaborative parts, including infrastructure, sensors, the system platform, and functions should be designed carefully [1], [2]. ...
... There are many studies that can recommend suitable parking spaces for drivers. The first study in this area was to find the nearest parking space using the support of a mobile phone's GPS [1], [2]. Unfortunately, GPS signal cannot work well in indoor environments, so if a car park is in a building the signal can be insufficient. ...
... Many functions have been proposed to find nearby parking spaces for drivers, including breadth-first search [1] and Dijkstra shortest path [5]. Nevertheless, these functions require a powerful GPS signal in an indoor environment. ...
The Internet of Things (IoT) is often embedded as a crucial part of many smart systems, especially in car park recommendation systems. Such recommendations require the knowledge of the current location of the car driver through a mobile application, yet existing mobile sensors such as GPS and Barometer sensor are not significantly qualified or stabilized to deliver a current location. Therefore, this research proposes using an installed IoT location based service, named Beacon, to act as a proximity sensor to transmit current car locations to recommend nearby parking spaces to the driver via a mobile application. The proposed system is explained in detail and implemented to test its accuracy. In the experiment, the accuracy of nearby parking space recommendations was assessed and compared with previous studies.
... The objectives of time and cost are important in choosing a parking lot and it is found that there are no vehicle cruising prevention schemes considering both time and cost in the market. Meanwhile, although some parking models were commonly used in analyzing and simulating transportation network [12,13] and algorithm was developed to help driver to look for parking lot [14], the car park guidance for drivers was ignored since drivers are ignorant of available car parks around the destination. Therefore, it is necessary to design a cruising prevention scheme to guide drivers to reduce the time of vehicle cruising for a parking lot which in turn will alleviate the burden of traffic congestion in cities. ...
... Some of the researches have considered the time element in car parking problem. A Wireless Mobile-based Car Parking System was developed by Soh et al. [14] to help drivers to receive information from car parking space through Short Message Service (SMS). Breadth First Search (BFS) algorithm was implemented and shown that it was able to locate the nearest parking space for drivers. ...
Full-text available
Vehicle cruising for a destination-nearby parking lot has been a problem to drivers in cities. This problem causes drivers to consume unexpected time and resources to compete for a parking lot. Conventional parking schemes are in place to predict or reserve the parking spaces. Some of these schemes optimize the total cost only for locating parking spaces and road traffic condition is usually ignored. In this investigation, key road traffic conditions, such as vehicle queueing at the intersection of roads and parking fee information, are considered since they influence time and cost in the parking process. As such, a new comprehensive parking scheme is needed in place to assist drivers to identify the appropriate parking lot, estimate the transportation time to reach the parking lot, as well as the parking expenses. In essence, the total journey time and the total cost are important factors. However, former research lacked a harmonious consideration of these two factors. In this paper, a new Parking Model (PM) is developed for a holistic optimization of time and cost. The performance is measured by a newly defined indicator, referred as Figure of Merit (FOM), which is a fusion of time and cost. Analysis reveals that the incorporation of PM improves the performance by 24% ~ 43%.
... Soh Chun Khang [7] proposes a parking system with the SMS service to the driver to be aware of the space availability in the parking lot. The space requisition for parking car is resend as SMS by the driver and this system behaves like the wireless mobile based car parking system with the efficient allocation of slots [2]. ...
Full-text available
Internet of Things is an emerging and enabling technology which is completely based on self-directed wireless senors. Sensors are organized in area to sense and monitor different physical characteristics of the internal and external parameters of many applications of real life scenarios which are more important for day by day life. In this research, an Intelligent Vehicle Parking System using sensors are modeled for the Smart parking system with real time scenarios. Wireless autonomous sensors plays a vital role in building the intellectual based smart parking system. These autonomous sensors exhibit communication among them and extend its communication to the central base station which acts as central for storing the sensed data for the further processing.
... In most of the cases, there is no manual or automated assistance to the driver in parking the car properly. This results in unnecessary wastage of considerable time and energy as well as congestion and chaos in the parking lot [5]. To overcome this problem, an efficient or smart parking system is required. ...
Full-text available
Background The abundant use of personal vehicles has raised the challenge of parking the vehicle in crowded places such as shopping malls. To help the driver with efficient and troublefree parking, a smart and innovative parking assistance system is required. In addition to discussing the basics of smart parking, Internet of Things (IoT), Cloud computing, and Fog computing, this chapter proposes an IoT-based smart parking system for shopping malls. Methods To process the IoT data, a hybrid Fog architecture is adopted in order to reduce the latency, where the Fog nodes are connected across the hierarchy. The advantages of this auxiliary connection are discussed critically by comparing with other Fog architectures (hierarchical and P2P). An algorithm is defined to support the proposed architecture and is implemented on two real- world use-cases having requirements of identifying the nearest free car parking slot. The implementation is simulated for a single mall scenario as well as for a campus with multiple malls with parking areas spread across them. Results The simulation results have proved that our proposed architecture shows lower latency as compared to the traditional smart parking systems that use Cloud architecture. Conclusion The hybrid Fog architecture minimizes communication latency significantly. Hence, the proposed architecture can suitably be applied for other IoT-based real-time applications.
The vehicles are parked in parking lots. These parking lots are found in malls, offices etc. These parking slots are marked on the ground with different size based on vehicles. An Automated Parking System transports vehicles from the entrance to a parking space that is available. Prior to this, car owners must make a reservation for specific parking lot. It takes time for new members to register and have parking assigned to them. An automated parking allotting app is created as well as a hardware implementation for this project. The owner of a car parking lot may sign up and build a parking facility in his area by registering the location and installing a Raspberry Pi with camera, which will automatically update the available parking spaces. The user find available parking slots using app and book a special slot for his or her car. A QR code will be generated, and the customer's bill will be generated based on in-time and out-of-time scanning. This method would be able to save time for car owners as well as and the amount of labor needed to complete the process as a result of this. As a result, this project saves time while also automating the process.
Traffic congestion due to the increasing number of vehicles is an alarming problem globally and aggravating day by day.
Due to rapid growth in urban population and advances in the automotive industry, the number of vehicles is increasing exponentially, posing the parking challenges. Automated parking systems provide efficient and optimal parking solution so that the drivers can have hassle free and quick parking. One of the demanding requirements is the design of smart parking systems, not only for comfort but also of economic interest. With the advancements in the Internet of Things (IoT), wireless sensors-based parking systems are the promising solutions for the deployment. Optimal positioning of IoT enabled wireless sensor nodes in the parking area is a crucial factor for the efficient parking model with the lower cost. In this paper, we propose a novel multi-objective grey wolf optimization technique for node localization with an objective to minimize a localization error. Two objective functions are considered for distance and geometric topology constraints. The proposed algorithm is compared with other node localization algorithms. Our algorithm outperforms the existing algorithms. The result shows that localization error is reduced up to 17% in comparison with the other algorithms. The proposed algorithm is computationally efficient due to the choice of fast converging parameters.
Conference Paper
Full-text available
To easily find an unoccupied parking space in a large car park is a problem for many drivers. Thus it is useful to have technical solutions which can provide information on parking space occupancy. A new monitor system is described in the following. It is based on passive magnetic field sensors. It provides occupancy information for car park users and helps them to place the car in a most efficient way
Indoor parking management operators in Malaysia, such as those managing car parks in hotels, office buildings, shopping malls, supermarkets, apartment complexes and convention centers have room for improvement. They can provide better services to their customers (i.e., vehicle owners). Currently, (1) they do not provide information on availability of parking space whether on site or remotely and (2) they do not provide security against car theft. This research proposes an Intelligent Parking Management System that will (1) provide information to vehicle owners on the availability of parking space on site or remotely (via PCs and mobile devices); (2) provide security for their cars against theft; (3) help car park operators to simplify their management and collection process. The system is implemented using the .NET platform and hardware (sensors, camera, and RFID).
We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of shortest paths algorithms. The interaction between the experimental evaluation of algorithm behavior and the theoretical analysis of algorithm performance plays an important role in our research.
There are a number of transportation applications that require the use of a heuristic shortest path algorithm rather than one of the standard, optimal algorithms. This is primarily due to the requirements of some transportation applications where shortest paths need to be quickly identified either because an immediate response is required (e.g., in-vehicle route guidance systems) or because the shortest paths need to be recalculated repeatedly (e.g., vehicle routing and scheduling). For this reason a number of heuristic approaches have been advocated for decreasing the computation time of the shortest path algorithm. This paper presents a survey review of various heuristic shortest path algorithms that have been developed in the past. The goal is to identify the main features of different heuristic strategies, develop a unifying classification framework, and summarize relevant computational experience.
An assertion that Dijkstra's algorithm for shortest paths (adapted to allow arcs of negative weight) runs in O(n3) steps is disproved by showing a set of networks which take O(n2n) steps.
Ready To SMS web service http
  • Informatel
No date) Carpark SMS [Online] Available
  • Monash University
Parking guidance andinformation systems
  • S Akihito
  • S Takumi
  • M Kozi
  • O Takeshi
S. Akihito, S. Takumi, M. Kozi and O. Takeshi, "Parking guidance andinformation systems," Vehicle Navigation and Information System Conference, 1995, pp478-485.
Available: messaging/datamsg-sms-charges
  • Digi
Amit's Game Programming Information
  • Amit Patel
Amit Patel, "Amit's Game Programming Information".[Online].